This content originally appeared on DEV Community and was authored by skptricks
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time.
Straight Insertion Sort using C
Let’s say we have an array a, so at each i-th pass, a[i] is successively compared with a[i-1], a[i-2], etc. until an element smaller than a[i] is found or the beginning of the array is reached. Elements that are found to be greater than a[i], are moved right by one position each to make room for a[i].
The time complexity of this algorithm is O(n^2).
The complete source code is given below
This content originally appeared on DEV Community and was authored by skptricks
skptricks | Sciencx (2021-05-13T04:20:20+00:00) Straight Insertion Sort Using C. Retrieved from https://www.scien.cx/2021/05/13/straight-insertion-sort-using-c/
Please log in to upload a file.
There are no updates yet.
Click the Upload button above to add an update.