Selection Sort versus Insertion Sort Algorithm Model

by smfein2019

Printable files (13)

  • stl

    Insertion_Sort_Model_2.STL

    307 Ko · 218 downloads

    Download
  • stl

    .275_radius_final_model_2.STL

    47 Ko · 216 downloads

    Download
  • stl

    .275_radius_final_model_2_back.STL

    66 Ko · 216 downloads

    Download
  • stl

    .275_radius_final_model_3.STL

    81 Ko · 215 downloads

    Download
  • stl

    .275_radius_final_model_3_back.STL

    81 Ko · 211 downloads

    Download
  • stl

    .275_radius_final_model_5.STL

    52 Ko · 216 downloads

    Download
  • stl

    .275_radius_final_model_5_back.STL

    52 Ko · 211 downloads

    Download
  • stl

    .275_radius_final_model_11.STL

    14 Ko · 211 downloads

    Download
  • stl

    .275_radius_final_model_11_back.STL

    14 Ko · 215 downloads

    Download
  • stl

    .275_radius_final_model_17.STL

    14 Ko · 212 downloads

    Download
  • stl

    .275_radius_final_model_17_back.STL

    14 Ko · 210 downloads

    Download
  • stl

    .275_radius_final_model_15.STL

    54 Ko · 216 downloads

    Download
  • stl

    .275_radius_final_model_15_back.STL

    54 Ko · 212 downloads

    Download

Description

This model was designed to help demonstrate the difference between the selection sort and insertion sort algorithm.

Insertion sort: The entire array begins unsorted. The largest value in the array is found

Selection sort: