Write the best case, worst case, and average case time complexity for the following sorting algorithms. Algorithm Best case Worst Case Average case…
Write the best case, worst case, and average case time complexity for the following sorting algorithms.
| Algorithm | Best case | Worst Case | Average case |
| Selection sort | |||
| Insertion sort | |||
| Merge sort | |||
| Quick sort | |||
| Heap sort |
From the DPDC Assistant Manager (ICT) June 2025 – Written (BUET) exam, question 7 of 8.
More from this paper
- Previous: A path finding robot is searching for shortest path Which algorithm will you select? Why? Write the steps how your chosen algorithm works.
- Next: Give examples of the following code smells: Feature envy Dead code Duplicate code Shotgun surgery
- All questions in DPDC Assistant Manager (ICT) June 2025 – Written (BUET)