Imagine you have a bookshelf with books and you are going to arrange these books in alphabetical order. If amount of books is not big then insertion sort is one of the possible way to sort them.
Tag Archives: O(n)
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