Update About IS Algorithm

Yash22222 · web-flow · commit 1dae91fea4a4 · 2023-07-25T21:10:21.000+05:30
diff --git a/Insertion Sort/About IS Algorithm b/Insertion Sort/About IS Algorithm
@@ -1 +1,4 @@
+- Insertion sort is a simple sorting algorithm that works similarly to the way you sort playing cards in your hands. The array is virtually split into a sorted and an unsorted part. Values from the unsorted part are picked and placed in the correct position in the sorted part.
+- To sort an array of size N in ascending order iterate over the array and compare the current element (key) to its predecessor, if the key element is smaller than its predecessor, compare it to the elements before. Move the greater elements one position up to make space for the swapped element.
+
 

Original file line number	Diff line number	Diff line change
`@@ -1 +1,4 @@`
	`1`	`+- Insertion sort is a simple sorting algorithm that works similarly to the way you sort playing cards in your hands. The array is virtually split into a sorted and an unsorted part. Values from the unsorted part are picked and placed in the correct position in the sorted part.`
	`2`	`+- To sort an array of size N in ascending order iterate over the array and compare the current element (key) to its predecessor, if the key element is smaller than its predecessor, compare it to the elements before. Move the greater elements one position up to make space for the swapped element.`
	`3`	`+`
`1`	`4`