Which of the following is/are true about insertion sort?
1
Insertion Sort will asymptotically work better when we use binary search instead of linear search.
2
Insertion sort best case if O(nlogn).
3
Between insertion sort and selection sort, selection sort is preferred when swap is costly instead of insertion sort.
4
Insertion sort work better when array is almost sorted.