Writing programs for sorting of a given set of numbers is one of the common programming tasks. Various types of sorting techniques like selection sort, inserting sort and quick sort are quite popular. Here C code for Quick sort is being presented. Here, in each iteration the array is subdivided into 2 arrays, and hence [...]
Archive for the ‘C’ Category
Posted in 
Tags: 
C Code for Bubble Sort
Posted by Saurabh on July 19th, 2010
Searching and sorting have been popular operations in elementry data structures. Although now a days many advanced sorting techniques are used to sort a set of data, the basic sorting methods are still popular and are the used frequently. Here C code for bubble sort is given. The algorithm for bubble sort is quite simple. [...]
C Code for Selection Sort
Posted by Saurabh on July 18th, 2010
Searching and sorting have been popular operations in elementry data structures. Although now a days many advanced sorting techniques are used to sort a set of data, the basic sorting methods are still popular and are the used frequently. Here C code for selection sort is given. The algorithm for selection sort is quite simple. [...]
C code for Insertion Sort
Posted by Saurabh on July 17th, 2010
Writing programs for sorting of a given set of numbers is one of the common programming tasks. Various types of sorting techniques like selection sort, inserting sort and quick sort are quite popular. Here C code for Insertion sort is being presented. The program is quite simple. Here, in each iteration, the elements are placed [...]
Make your C program run 50-100% times faster by using OpenMP
Posted by Saurabh on May 7th, 2010
OpenMp has been around us for quite some time now and now we all know how simple it is to incorporate OpenMp pragmas to make the program run faster. Here a sample C code for matrix multiplication is been presented. The code contains the same operations, one being processed serially and the other one being [...]
