Insertion SortInsertion sort is the simple sorting algorithm which is commonly used in the daily lives while ordering a deck of cards. In this algorithm, we insert each element onto its proper place in the sorted array. This is less efficient than the other sort algorithms like quick sort, merge sort, etc. TechniqueConsider an array A whose elements are to be sorted. Initially, A[0] is the only element on the sorted set. In pass 1, A[1] is placed at its proper index in the array. In pass 2, A[2] is placed at its proper index in the array. Likewise, in pass n1, A[n1] is placed at its proper index into the array. To insert an element A[k] to its proper index, we must compare it with all other elements i.e. A[k1], A[k2], and so on until we find an element A[j] such that, A[j]<=A[k]. All the elements from A[k1] to A[j] need to be shifted and A[k] will be moved to A[j+1]. Complexity
Algorithm
C ProgramOutput: Printing Sorted Elements . . . 7 9 10 12 23 23 34 44 78 101 C++ ProgramOutput: printing sorted elements... 7 9 10 12 23 23 34 44 78 101 Java ProgramOutput: Printing sorted elements . . . 7 9 10 12 23 23 34 44 78 101 C# ProgramOutput: printing sorted elements . . . 7 9 10 12 23 23 34 44 78 101 Python ProgramOutput: printing sorted elements . . . 7 9 10 12 23 23 34 44 78 101 Swift ProgramOutput: printing sorted elements... 7 9 10 12 23 23 34 44 78 101 JavaScript ProgramOutput: printing sorted elements ... 7 9 10 12 23 23 34 44 78 101 PHP ProgramOutput: printing sorted elements ... 7 9 10 12 23 23 34 44 78 101
Next TopicMerge Sort
