Radix Sort

Best Case: O(n)
Average Case: O(n)
Worst Case: O(n)

Counting Sort

Best Case: O(n)
Average Case: O(n)
Worst Case: O(n)

Heap Sort

Best Case: O(n lg n)
Average Case: O(n lg n)
Worst Case: O(n lg n)

Quick Sort

Best Case: O(n lg n)
Average Case: O(n lg n)
Worst Case: O(n^2)

Insertion Sort

Best Case: O(n)
Worst Case: O(n^2)

Selection Sort

Best Case: O(n^2)
Worst Case: O(n^2)

Bubble Sort

Best Case: O(n)
Worst Case: O(n^2)

What Are the Different Sorting Algorithms

List of Different Sorting Algorithms
* Bubble Sort
* Balloon Sort
* Merge Sort
* Insertion Sort
* Radix Sort
* Quick Sort
* Selection Sort
* Combo Sort
* Shell Sort
* Heap Sort
* Tree Sort
* Counting Sort

Common Programmer's Errors

The most common error made by any programmer is using an algorithm without taking into consideration the processing time it needs to finish its job.

When I was a kid, the only sorting algorithm that I knew was the bubble sort and the balloon sort. At that time, whenever I write a program to sort, I uses any of these two.

But later, I have learned that these two algorithms are the worse sorting algorithms. In this blog, you will soon know why.

Pre-requisites

The study of Design and Analysis of Algorithms needs the study and background of Discrete Mathematics. You should also needs to understand that you should know how to analyze an algorithm before you could successfully design your own algorithms.

In this blog, topics are not arranged into the level of difficulties. In fact, there is no order or arraignment of postings in this blog. I'll just post whatever I have in mind anytime I wanted it to. However, I will put some labels, classifications or categories to make it easier for you to do some research or studies.

About This Blog: Sorting Algorithms

This blog focuses on the Design and Analysis of Algorithms. Please make some comments. This is a project of Agoo Computer College.