{"id":461,"date":"2025-06-29T20:01:24","date_gmt":"2025-06-29T14:31:24","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=461"},"modified":"2025-06-29T20:01:25","modified_gmt":"2025-06-29T14:31:25","slug":"recursive-bubble-sort","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/recursive-bubble-sort\/","title":{"rendered":"Recursive Bubble Sort in Python"},"content":{"rendered":"\n

You\u2019re given an unsorted array of integers and asked to sort it in non-decreasing order using Bubble Sort, but implemented recursively<\/em>, without any explicit loops<\/strong>.<\/p>\n\n\n\n

Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

Bubble Sort works by repeatedly \u201cbubbling\u201d the largest (or smallest) element to the end of the current segment through adjacent swaps. In its classic iterative form, this takes two nested loops. The challenge here is to reproduce the same behavior with a recursive function.<\/p>\n\n\n\n

Example<\/strong><\/p>\n\n\n\n

Input array<\/th>Output array<\/th><\/tr><\/thead>
[5, 1, 4, 2, 8]<\/code><\/td>[1, 2, 4, 5, 8]<\/code><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n
\n\t\t\t
\n\t\t\t\t
Contents:<\/div>\n\t\t\t\t
\n\t\t\t
\n\t\t\t\u00a0[show<\/a>]\n\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t<\/div>\n\t\t<\/div>
\n\t\t\t
\n\t\t\t\t