The average case complexity of Insertion Sort is

Related MCQs

• Give timing complexities of three sorting algorithms bubble sort,selection sort,insertion sort respectively.
• Best and the worst case timing complexities of insertion sort are_________.
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked lis
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list
• Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the end node of the linked list
• Consider that n elements are to be sorted.The worst case complexity of bubble sort is____
• Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?
• What is the number of swaps required to sort n elements using selection sort, in the worst case?
• The complexity of the average case of an algorithm is
• The complexity of the average case of an algorithm is