Computer Science · Analysis of Algorithms
What is the recurrence relation for the Bubble Sort procedure to sort 'n' numbers in ascending order in the worst case?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1T(n) = T(n - 2) + n - 1 for n > 1
- 2T(n) = T(n / 2) + n for n > 1
- 3T(n) = T(n - 1) + 1 for n > 1
- 4T(n) = T(n - 1) + n - 1 for n > 1✓
Correct answer
T(n) = T(n - 1) + n - 1 for n > 1
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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Analysis of Algorithms MCQs →Want more practice questions on Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Analysis of Algorithms