Common algorithms

Dijkstra’s algorithm finds the shortest path in graphs with non-negative edge weights. The algorithms can be described as following actions: […]

Counting sort is a non-comparison sorting algorithm that works in linear time, but only applies to arrays with integer values.

This algorithm is slightly faster than merge sort and heap sort on random data. Uses a divide-and-conquer approach. The main

Merge sort is an efficient, stable divide-and-conquer algorithm. The main idea of this algorithm is as follows: Time complexity: O(n

This algorithm is more efficient than bubble sort and selection sort. The main idea of the algorithm is as follows:

The idea of selection sort: iteratively find the smallest (or largest) element in the remaining part of array and put

Bubble sort algorithm is one of the most well-known sorting algorithms, commonly taught in schools, universities and various computer courses.

Binary search is a fundamental algorithm that finds elements in sorted arrays in O(log n) time. It can be utilized

The BFS algorithm for graphs works as follows:

Graph DFS algorithm is similar to DFS in Trees. Two differences:– a graph node can have any number of neighbors–