Quicksort is one of the fastest known algorithms for sorting arrays (in average it requires O (n log n) exchanges to order n elements). The algorithm was developed by Tony Hoare in 1960 during his work at Moscow State University. As it counterpart merge sort, it uses divide and conquer paradigm.

# Tag Archives: sorting algorithm

# Merge sort

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.

# Insertion 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.

###### Theory

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