{"id":541,"date":"2023-03-23T07:34:19","date_gmt":"2023-03-23T07:34:19","guid":{"rendered":"http:\/\/learnlearn.uk\/ibcs\/?page_id=541"},"modified":"2023-06-09T13:03:07","modified_gmt":"2023-06-09T13:03:07","slug":"bubble-sort","status":"publish","type":"page","link":"https:\/\/learnlearn.uk\/ibcs\/bubble-sort\/","title":{"rendered":"Bubble Sort"},"content":{"rendered":"
\n

Introduction<\/h2>\n
\n\n

Bubble Sort<\/h3>\n

Time Complexity:\u00a0O(n\u00b2) – Space Complexity: O(1)<\/span><\/p>\n

Pretty much the worst sorting algorithm ever, mostly just used in teaching as a comparison tool. There are almost <\/a>no legitimate use cases where it is the most efficient algorithm.<\/p>\n

The bubble sort algorithm works by sorting through the array in pairs. It starts at the left of the array and inspects the first two items. If the items are in the wrong order they are swapped around. The algorithm then carries on with the next pair along and so forth. When it reaches the end of the array it goes back to the beginning of the array and starts again. If it completes a full pass of the array without swapping any items it knows that the array is sorted.<\/p>\n

\"Bubble<\/a><\/p>\n\n<\/div>

Tutorial Video<\/h2>\n
\n\n

Bubble Sort Python Tutorial<\/strong><\/p>\n