Category Archives: Sorting Algorithm

There are many sorting algorithms in Computer Science Data Structure, and most of those give the same time complexity which is O(nlogn), where n represents the total number of elements present in the given structure, and the sorting algorithms which satisfy this time complexity are Merge sort, Quick-sort, Heap sort, etc. There is another sorting algorithm Counting sort… Read More »

What is Shell Sort?

In sorting algorithms, we have some basic type of algorithms which can sort the elements in a specific order, often we use an array and sort its elements in numeric and lexicographical order. Shell sort is an extension and improved version of insertion sort. In insertion sort we took an element and compare it with its previous elements… Read More »

What is Sorting

What is Sorting? In Sorting Algorithms, we arrange the elements in a specific order it could be ascending or descending. We apply sorting algorithms on those data structures which are iterable, and most often which contain numeric data types. Though the sorting could be in any order, often we ordered our data structures element into numerical or lexicographical… Read More »

Counting Sort in C

Before jump to the counting sort in c, first, you have to understand that what is sorting, what are the sorting algorithms, and the need to use sorting algorithms. Sorting is generally required when we need to arrange data in a particular sequence or arrangement, especially when the data is large. Counting sort takes O(n+k) time to sort… Read More »

Heap Sort in C

When we deal with a large set of data, we want that data to organize in a specific order, so whenever we want to search for a particular item, we could find it at no time. For this, we have sorting algorithms, sorting algorithms help us to sort the elements in a specific order so our searching algorithms… Read More »

Recursive Bubble Sort in C

Recursive Bubble sort in C is the sorting algorithm used to arrange a list in a particular form that can be ascending, descending in numerical or lexicographical order. Bubble sort named for the smaller or larger elements to be “bubble” to the top of the list. Bubble sort is the simplest sorting algorithm.

Quick Sort in C [Program & Algorithm] | C Program for Quick Sort

Before directly jump to learn the Quick sort in C, a general question must raise to your mind that what is sorting and why you need to learn this. So the answer is if you are a software developer than it becomes necessary that you have the knowledge of those all techniques which are required to the software… Read More »

Merge Sort in C

Merge Sort in C is a sorting algorithm. When you have a large data collection that is not arranged and it requires you to search a particular data set in the collection then a sorting technique is used to arrange large data in a sequence. Sorting reduces the time of data searching in large data collection. There are… Read More »

Insertion Sort in C

Before explaining the insertion sort in c, you must know what is sorting and why to use it. In simple words, sorting is a way to arrange any collection of data in a systematic or orderly manner that can be either numbers or alphabets. The need for sorting becomes very high when the amount of data is large.… Read More »

Bubble Sort in C

Bubble sort in C is the most straightforward sorting technique to sort an array. Sorting is the technique used to arrange a variety in a structured way that can be ascending or descending in a numerical or lexicographical order. It is a well-known competitive approach that every programmer must know. Sorting is required to reduce the time when… Read More »