Physics · Algorithms
Which of the following sorting algorithms has the lowest worst-case time complexity?
- 1Selection Sort
- 2Bubble Sort
- 3Merge Sort✓
- 4Quick Sort
Correct answer
Merge Sort
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Physics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Physics · Algorithms