feat: spring 2025, all hands project 3, team 2 - Linear, Binary Search, BST comparisions

[hemanialaparthi]

This pull request adds a detailed analysis of search algorithms (linear search, binary search, and balanced binary search tree) to the allhands/spring2025/weeksixteen/teamtwo/index.qmd file. It includes a comprehensive benchmarking study, code examples, and performance comparisons across varying dataset sizes and target positions.

Key Additions:

Algorithm Analysis and Benchmarking:

• Introduces a study comparing the runtime efficiency of linear search, binary search, and balanced BST algorithms, focusing on dataset size and target position.
• Provided benchmarking results for different operating systems (MacOS and Windows) with detailed performance metrics, including average execution times for varying dataset sizes, search algorithms, and target positions.