Question

Compare the efficiency of bubble sort with insertion sort​

Answer 1

$\huge\mathfrak\purple{Answer}$

Best case complexity is of O(N) while the array is already sorted. Number of swaps reduced than bubble sort. For smaller values of N, insertion sort performs efficiently like other quadratic sorting algorithms. ... Adaptive: total number of steps is reduced for partially sorted array.

$\huge\mathfrak\purple{■■■■■■■■■■■■}$