Insertion sort

Insertion sort is a method of sorting data, such as numbers, one item at a time. It is not a very efficient method compared to other algorithms such as quicksor

Insertion sort

Insertion sort is a method of sorting data, such as numbers, one item at a time. It is not a very efficient method compared to other algorithms such as quicksort. However, it is a very simple algorithm that is easy to build.

Think about the sequence of numbers in the picture below. It starts with a small number (written as ≤x), then a big number (≥x) and then a medium sized number (written as x). If this had specific numbers, it might start with 2 (small), 10 (big), 4 (medium). The number 10 is bigger than the number 4. So if the sequence were in order from smallest to biggest, it should start with 2, 4, 10. So the second and third numbers should be swapped. So, in the example below, the sequence should start with ≤x, x, ≥x.


When the sequence is sorted, the medium number is moved in between the small (≤x) and big (≥x) numbers. So the sequence becomes:

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.