resolved merge conflict

This commit is contained in:
Ayaan Khan 2020-07-01 04:04:49 +05:30
commit efcccd0148

View File

@ -26,15 +26,15 @@
* the algorithms goes in the manner that we start iterating over the array
* of elements as soon as we find a unsorted element that is a misplaced
* element we place it at a sorted position.
*
*
* Suppose initially we have
* <pre>
* 4 3 2 5 1
*
*
* we start traversing from 4 till we reach 1
* when we reach at 3 we find that it is misplaced so we take 3 and place
* it at a correct position thus the array will become
*
*
* 3 4 2 5 1
*
* in the next iteration we are at 2 we find that this is also misplaced so
@ -57,7 +57,7 @@
/** \brief
* Insertion Sort Function
*
*
* @param arr Array to be sorted
* @param n Size of Array
*