1 / 28

Insertion Sort

Insertion Sort. Array index. 0. 1. 2. 3. 4. 5. 6. 7. 8. 9. Insertion sort. In ith iteration: read ith value repeatedly swap value with the one to its left if it is smaller

sebastian-lane
Télécharger la présentation

Insertion Sort

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 2.78 7.42 0.56 1.12 1.17 0.32 6.21 4.42 3.14 7.71 Iteration 0: step 0.

  2. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 2.78 7.42 0.56 1.12 1.17 0.32 6.21 4.42 3.14 7.71 Iteration 1: step 0.

  3. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 0.56 7.42 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 2.78 7.42 0.56 1.12 1.17 0.32 6.21 4.42 3.14 7.71 Iteration 2: step 0.

  4. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 0.56 2.78 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 2.78 0.56 7.42 1.12 1.17 0.32 6.21 4.42 3.14 7.71 Iteration 2: step 1.

  5. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 2.78 7.42 1.12 1.17 0.32 6.21 4.42 3.14 7.71 Iteration 2: step 2.

  6. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 1.12 7.42 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 2.78 7.42 1.12 1.17 0.32 6.21 4.42 3.14 7.71 Iteration 3: step 0.

  7. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 1.12 2.78 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 2.78 1.12 7.42 1.17 0.32 6.21 4.42 3.14 7.71 Iteration 3: step 1.

  8. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 1.12 2.78 7.42 1.17 0.32 6.21 4.42 3.14 7.71 Iteration 3: step 2.

  9. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 1.17 7.42 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 1.12 2.78 7.42 1.17 0.32 6.21 4.42 3.14 7.71 Iteration 4: step 0.

  10. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 1.17 2.78 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 1.12 2.78 1.17 7.42 0.32 6.21 4.42 3.14 7.71 Iteration 4: step 1.

  11. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 1.12 1.17 2.78 7.42 0.32 6.21 4.42 3.14 7.71 Iteration 4: step 2.

  12. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 0.32 7.42 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 1.12 1.17 2.78 7.42 0.32 6.21 4.42 3.14 7.71 Iteration 5: step 0.

  13. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 0.32 2.78 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 1.12 1.17 2.78 0.32 7.42 6.21 4.42 3.14 7.71 Iteration 5: step 1.

  14. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 0.32 1.17 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 1.12 1.17 0.32 2.78 7.42 6.21 4.42 3.14 7.71 Iteration 5: step 2.

  15. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 0.32 1.12 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 1.12 0.32 1.17 2.78 7.42 6.21 4.42 3.14 7.71 Iteration 5: step 3.

  16. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 0.32 0.56 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.56 0.32 1.12 1.17 2.78 7.42 6.21 4.42 3.14 7.71 Iteration 5: step 4.

  17. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 7.42 6.21 4.42 3.14 7.71 Iteration 5: step 5.

  18. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 6.21 7.42 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 7.42 6.21 4.42 3.14 7.71 Iteration 6: step 0.

  19. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 6.21 7.42 4.42 3.14 7.71 Iteration 6: step 1.

  20. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 4.42 7.42 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 6.21 7.42 4.42 3.14 7.71 Iteration 7: step 0.

  21. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 4.42 6.21 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 6.21 4.42 7.42 3.14 7.71 Iteration 7: step 1.

  22. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 4.42 6.21 7.42 3.14 7.71 Iteration 7: step 2.

  23. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 3.14 7.42 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 4.42 6.21 7.42 3.14 7.71 Iteration 8: step 0.

  24. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 3.14 6.21 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 4.42 6.21 3.14 7.42 7.71 Iteration 8: step 1.

  25. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 3.14 4.42 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 4.42 3.14 6.21 7.42 7.71 Iteration 8: step 2.

  26. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 3.14 4.42 6.21 7.42 7.71 Iteration 8: step 3.

  27. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 3.14 4.42 6.21 7.42 7.71 Iteration 9: step 0.

  28. Insertion Sort Array index 0 1 2 3 4 5 6 7 8 9 • Insertion sort. • In ith iteration: • read ith value • repeatedly swap value with the one to its left if it is smaller • Property: after ith iteration, array positions 0 through i contain original elements 0 through i in increasing order. Value 0.32 0.56 1.12 1.17 2.78 3.14 4.42 6.21 7.42 7.71 Iteration 10: DONE.

More Related