[Home]  [Edit this page]  [Recent Changes]  [Special Pages]  [Help] 

---

InsertionSort

---

(Computer Science) Insertion sort

From [1]: "Sorting takes place by inserting a particular element at the appropriate position. To sort the element in ascending order, in first iteration, 1st element is compared with the 0th element. In the second iteration 2nd element is compared with 0th and 1st element. In general, in every iteration an element is compared with all the elements before it. While comparing if it is found that the element in question can be inserted at a suitable position, then space is created for it by shifting the other element one position to the right and inserting the element at the suitable position. This procedure is repeated for all the elements in the list."

'Insertion sort' links

• C++

Reference

• 1) http://electroguys.com/articles/sorting/

[Edit this page]  [Page history]  [What links here]  [Discuss this topic]  [Printer Friendly]