Now that we are practising searching and sorting algorithms since past 2 weeks, it's the time to do some questions that involves their usage. Since the weeekend is here, try out these problems.
A huge shoutout to Hackerearth and Geeks4Geeks for having such great collecton of problems.
Try out as many problems as you can, the contribution guidelines for today would be a little different (I've mentioned them after this list of links)
- Linear Search
- Binary Search
- Ternary Search
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Radix Sort
- Heap Sort
- Make a folder in this directory (day37), and the name of the folder should be the name of the problem (Example:
divide apples
). - In the folder add the README.md
- Copy paste the question and sample input output in the README.md
- Add credits at the start like this
Question Source: HackerEarth
Question Link: https://www.hackerearth.com/practice/algorithms/sorting/heap-sort/practice-problems/algorithm/divide-apples/
- Add your code to README
- Add the file containing the code in the same directory.