Task Description: Study and implement various sorting algorithms, including bubble sort, insertion sort, selection sort, merge sort, quick sort, and heap sort. Then, apply the binary search algorithm to find input integer element in a sorted array.
- Clean Code
- Binary Search
- Object Oriented Programming (OOP)
- Use Dynamic Arrays C++ Libraries (Vector)
- Implement 5 Sorting Algorithms (at Least 3)
- Fork This Repository and Commit Your Codes on It