0 votes 0 votes Insertion sort uses an incremental approach for designing algorithm can someone please explain? Algorithms sorting cormen algorithm-design + – saurabh12345 asked Jul 24, 2018 • retagged Jun 17, 2022 by makhdoom ghaya saurabh12345 421 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Insertion sort sorts the elements one by one in incremental manner, After first pass, first element is sorted. After second pass, first two elements are sorted. . . After nth pass, all n elements are sorted. Vinay Patel answered Jul 24, 2018 Vinay Patel comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Jul 25, 2018 reply Follow Share @vinay, then Selection Sort or Bubble sort is also follow this. in my opinion ( i am not sure ) incremental means, insertion sort always insert a element in sorted array. 0 votes 0 votes Please log in or register to add a comment.