Basics Merge Sort is a divide and conquer algorithm. The algorithm is based on the principle that a one-element algorithm is sorted a priori. The algorithm starts by recursively dividing the list into smaller ones. Read more…
Basics The main requirement for the binary search is: Array must be sorted. The binary search work in the same way as searching phone number by person name in phonebook. Or similar to searching word Read more…
Basics In the previous post, we talked about reverse the entire LinkedList. You also can get info about what is it LinkedList and a high-level view of how it works. Here is the link: https://www.hrupin.com/2020/12/reverse-a-linked-list-in-groups-of-given-size-algorithm Read more…