## Dijkstra algorithm

The Dijkstra algorithm serves to find the cheapest path in acyclic graphs with positive weights. The algorithms can be described […]

Common algorithms, Interview preparation## Dijkstra algorithm

The Dijkstra algorithm serves to find the cheapest path in acyclic graphs with positive weights. The algorithms can be described […]

Common algorithms, Interview preparation## Counting sort

This is a very fast algorithm, but can only be used with arrays with integer values. This algorithm can be

Common algorithms, Interview preparation## Quick sort

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

Common algorithms, Interview preparation## Merge sort

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

Common algorithms, Interview preparation## Insertion sort

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

Common algorithms, Interview preparation## Selection sort

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

Common algorithms, Interview preparation## Bubble sort

Bubble sort algorithm is the most famous sorting algorithm as it is studied in schools, universities and various computer courses.

Common algorithms, Interview preparation## Binary search algorithm

Binary search algorithm is a widely used algorithm for sorted sequences. It can be utilized not only for searching, but

Common algorithms, Interview preparation## BFS in Graphs

The BFS algorithm in Graphs implies the following:

Common algorithms, Interview preparation## DFS in Graphs

Graph DFS algorithm is so similar to DFS in Trees. Two differences:– a graph node can have more than 2