Space complexity is O(1) because an extra variable key is used. It occurs when the elements of an array are in jumbled order (neither ascending nor descending). So, there are only n number of comparisons. When the array is already sorted, the outer loop runs for n number of times whereas the inner loop does not run at all. Thus, the total number of comparisons = n*(n-1) ~ n 2 SimpleCardGame/SimulateGame.java Go to file Cannot retrieve contributors at this time 234 lines (198 sloc) 6.91 KB Raw Blame / Matt Levan CSC 331, Dr. In this case, worst case complexity occurs.Įach element has to be compared with each of the other elements so, for every nth element, (n-1) number of comparisons are made. Suppose, an array is in ascending order, and you want to sort it in descending order. Insertion Sort in Python, Java, and C/C++ Place 4 behind 1 Place 3 behind 1 and the array is sorted

Similarly, place every unsorted element at its correct position.

If there is no element smaller than it, then place it at the beginning of the array. Placed it just behind the element smaller than it. Take the third element and compare it with the elements on the left of it.

Now, the first two elements are sorted.

If the first element is greater than key, then key is placed in front of the first element. Take the second element and store it separately in key.Ĭompare key with the first element.

The first element in the array is assumed to be sorted.

Suppose we need to sort the following array. In the same way, other unsorted cards are taken and put in their right place.Ī similar approach is used by insertion sort. If the unsorted card is greater than the card in hand, it is placed on the right otherwise, to the left. We assume that the first card is already sorted then, we select an unsorted card. Insertion sort works similarly as we sort cards in our hand in a card game. Insertion sort is a sorting algorithm that places an unsorted element at its suitable place in each iteration.

Decrease Key and Delete Node Operations on a Fibonacci Heap.

Simple card game java source code