DS Sorting techniques and algorithms with complexity

SORTING TECHNIQUES

Sorting is nothing but storage of data in ascending or descending order.

There are many sorting techniques available. The efficiency of any sorting technique depends on two parameters:

• Execution time of program
• Space taken by program

DIFFERENT SORTING TECHNIQUES

The different sorting techniques are as follows:

1. Bubble Sort
2. Insertion Sort
3. Selection Sort
4. Quick Sort
5. Merge Sort
6. Heap Sort

COMPLEXITY OF SORTING ALGORITHMS

The complexities of different sorting algorithms are listed as follows:

Share on Facebook

Share on Twitter

Share on Google+

Share on LinkedIn

Related Post

• MERGE SORT Merge Sort is a divide and conquer algorithm that was invented by John von Neumann in 1945. Conceptually, a mer ...
• QUICK SORT Quick Sort is a divide and conquer algorithm. It first divides a large array into two smaller sub-arrays: the lo ...
• C Interview Question With Answers 1. What is C? C is a simple, procedure or structure oriented and middle level programming language. It was develo ...
• OS interview Questions with Answers 1. What is an operating system? An operating system is a program that acts as an intermediary between the us ...
• Bubble Sort Bubble Sort is the simplest sorting algorithm which compares all the adjacent elements one by one and sort them if th ...