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.

Top Programming tips for C and C++ Programmers

Today I will discuss top coding tips which can be applied to any particular programming language. Also these tips will help you to write self documented programs which are easy to maintain and understand by anyone.