18CSC201J – Data Structures
Session 10 – Insertion sort
, INSERTION SORT
• One of the simplest sorting algorithms that construct the
final sorted array by one element at a time.
• In-place comparison-based sorting algorithm.
• The array elements are compared with each other
sequentially and then arranged simultaneously in some
particular order
Session 10 – Insertion sort
, INSERTION SORT
• One of the simplest sorting algorithms that construct the
final sorted array by one element at a time.
• In-place comparison-based sorting algorithm.
• The array elements are compared with each other
sequentially and then arranged simultaneously in some
particular order
