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. This process is called “partitioning”. This continues until the length of the sublists becomes 1. 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 in the dictionary. For example you need to find word “Mars”. What the steps people 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 Today we will talk about a case when we need to revert linked list nodes Read more…
Basics Linked list is a data structure each element of those has link to the next element. Each element of the linked list called node The node of linked list called head. To identify the whole linked list we need link to head only. The linked lists are great in Read more…
Algorithm for finding the shortest path from one vertex of the graph to all the others. This algorithm was developed by the Dutch scientist Edsger Wybe Dijkstra in 1959. The algorithm works only for a directed graph in which the edges have no negative weight and do not have loops. Read more…
Overview The quicksort algorithm was discovered by Tony Hoare in 1959. This algorithm is considered one of the fastest sorting algorithms and shows the best results in most cases. Here is the algorithm visualization. Below I will describe how it works. The algorithm works on the “divide and conquer” principle. Read more…
Insertion Sort appeared a long time ago. Intuitively, we use it to sort the cards in hand during card games. This is the easiest way to illustrate how this algorithm works. How the algorithm works Each element of the input sequence is scanned one at a time and compared with Read more…