0 votes 0 votes Average number of comparisons of insertion sort is better than bubble sort by a constant factor ? True or False? Shadan Karim asked Dec 16, 2018 Shadan Karim 367 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply kumar.dilip commented Dec 16, 2018 reply Follow Share True. 0 votes 0 votes Shadan Karim commented Dec 16, 2018 reply Follow Share Please explain 0 votes 0 votes Mk Utkarsh commented Dec 16, 2018 reply Follow Share both do $O(n^2)$ comparisons in worst case 0 votes 0 votes akash.dinkar12 commented Dec 17, 2018 reply Follow Share but he is asking about the average number of comparisons? 0 votes 0 votes Shobhit Joshi commented Dec 17, 2018 reply Follow Share The statement is True, as in bubble sort we will always do $\frac{n*(n-1)}{2}$ where n is the size of the array, but in insertion sort we sometimes do less number of comparisons, so average number of comparisons of insertion sort would be less. 0 votes 0 votes Please log in or register to add a comment.