Tag: Sorting

Implementation of various Sorting Algorithms in C++

Posted by M. Saqib | Sep 9, 2008 | C++ Source Code: C++ Programming Concepts |

This is a C++ implementation of various sorting algorithms. The list of algorithms include Bubble Sort, Heap Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort and Shell Sort. A brief description of each sorting algorithm is listed below along with their complexity.

C Implementation of Various Sorting Algorithms

Posted by M. Saqib | Sep 9, 2008 | C Programming Source Code |

Quicksort implementation in C

Posted by M. Saqib | Mar 16, 2008 | Blog |

Quicksort is a well-known sorting algorithm developed by C.A.R. Hoare: Quicksort. QuickSort is an efficient algorithm based on Divide and Conquer rule and is still a commonly used algorithm for sorting. It works by selecting a ‘pivot’ element from the array and partitioning the other elements into two sub-arrays and recursively sorting them.