Tag Archives: sorting algorithm

Merge sort

The maxim “Divide et impera” or divide and conquer took root in the Greek kingdom of Macedon. In times of Philip II of Macedon (359–336 BC) who was the father of Alexander the Great.


It seems that initially this rule was used in politics, warfare and in tactical maneuvers. But nowadays, we can also meet this principle in economics, computer science, usually we can solve a complex problem using divide and conquer technique. The main idea behind this is to take something big and divide it into small pieces, farther, we can easy work with small piece.

Continue reading Merge sort

Introduction into Sorting Algorithms And Bubble Sort

Bubble sort is a very simple sorting algorithm which can be used for introduction into sorting algorithms. But, before we start learning it we need some basic theory about sorting algorithms.



Lets start from the definition. Sorting algorithm (SA) is an algorithm that orders elements of a list in a numeric or lexicographical order. Basically SA’s can be classified by following properties: Continue reading Introduction into Sorting Algorithms And Bubble Sort