Sort Huge amount of data

The bigsort routine implements a way to sort huge amounts of data that do not fit into main memory by using a multi-phase sorting on files. It is a implementation from the book “Algorithms and data structures” by Niklaus Wirth. Additionally, this routine...

Generating fast sorting routines

In a lot of programs my gensort-utility turned out to be very useful. It consists simply of the header file “gensort.h”, contained in the above package. To obtain a sorting routine, simply define the name of the routine, the data type you want to sort and...

String Sorting in Java

This is a sample Java program to demonstrate string sorting. The function uses a space character as a separator between words. It iterates through each word in the input string and creates a words[] array. Finally it sorts the array of the words in ascending order of the letters i.e. a->z and displays the sorted array by printing one word at each line.

Bubble Sort C Program

Bubble Sort is the most simple form of sorting algorithm that works by repeatedly stepping through the list of items (array) and swapping the adjacent elements if they are in incorrect order. This algorithm has no such real life uses due to it’s poor performance and is used primarily as an educational tool.

Implementation of various Sorting Algorithms in C++

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

This is a simple C implementation of various sorting algorithms such as Bubble Sort, Insertion Sort, Selection Sort and Shell Sort.   Bubble Sort Bubble sort, is a simple comparison-based sorting algorithm that repeatedly steps through the list, compares adjacent...

Quicksort implementation in C

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.