Major Enhancement: Bug Fixes, Multi-language Support, and Algorithm Expansion

[Abang111]

Summary

This PR introduces a major contribution to the "IntroductionToAlgorithms" project by addressing critical bugs, adding support for multiple programming languages (C++ and Java), enhancing documentation, and implementing several new algorithms.

Key Contributions

1. Bug Fixes and Code Improvements

   • Fixed index error in BinarySearch.py caused by float division, replaced with integer division //.
   • Improved base-case handling in StrassenAlgorithm.py to optimize performance.
   • Unified code style by updating Python 2 print statements to Python 3 print() functions.

2. New Algorithms Added

   • MiddleSelect.py: Deterministic median selection using Median of Medians.
   • RandomizedSelect.py: Efficient randomized selection algorithm.
   • OpenAddressingHash.py: Implemented linear probing hash table.

3. Multi-language Support

   • Translated core algorithms to C++ and Java, including QuickSort, MergeSort, and BinarySearch.
   • Maintained logical consistency and added detailed comments for each language version.

4. Documentation and Testing

   • Created README.md, README.md, and CHANGELOG.md to improve project accessibility.
   • Added time complexity analysis, usage examples, and algorithm explanations.

Notes

• All contributions were made following GitHub best practices (forking, feature branches, commit history, and PR formatting).
• Although some pull requests are pending review, we remain active and ready to iterate based on feedback.
• This PR aims to make the project more robust, accessible, and educational for a wider developer audience.

We hope these improvements can bring long-term value to the project and the open-source learning community.