Sorting algorithms are a set of instructions that takes an array or list as an input and arrange the items into a particular order.
Why sorting algorithms are important?
Since sorting can often reduce the complexity(level of complex) of a problem, it is ah important algorithms in computer science.
- Selection Sorting: This sorts an array by repeatedly finding the maximum elements (considering ascending order) from unsorted part and putting it at the beginning.
2 Bubble Sort: This is the simplest sorting algorithms that works by repeatedly swapping the adjacent element they are in wrong order.
3 Insertion Sorting: This is the sorting algorithms when the sorted array is build having one item at a time. The array elements are compared with each other sequentially and they are arranged simultaneously in some particular order.
4 Merge sorting: This is a divide and conquer algorithms it divides the input array into two halves, call itself for the two halves and then merges the two sorted halves.
5 Quick Sort: Like merge sort, quick Sort is a divide and conquer algorithms. It picks an element as pivot and partition the given array around the picked pivot.
Top comments (0)