{"version":"1.0","provider_name":"IB Computer Science","provider_url":"https:\/\/learnlearn.uk\/ibcs","author_name":"learnlearnadmin","author_url":"https:\/\/learnlearn.uk\/ibcs\/author\/learnlearnadmin\/","title":"Bubble Sort - IB Computer Science","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"TUD2Oof6oy\"><a href=\"https:\/\/learnlearn.uk\/ibcs\/bubble-sort\/\">Bubble Sort<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/learnlearn.uk\/ibcs\/bubble-sort\/embed\/#?secret=TUD2Oof6oy\" width=\"600\" height=\"338\" title=\"&#8220;Bubble Sort&#8221; &#8212; IB Computer Science\" data-secret=\"TUD2Oof6oy\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script>\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n\/\/# sourceURL=https:\/\/learnlearn.uk\/ibcs\/wp-includes\/js\/wp-embed.min.js\n<\/script>\n","description":"Bubble Sort Time Complexity:\u00a0O(n\u00b2) &#8211; Space Complexity: O(1) Pretty much the worst sorting algorithm ever, mostly just used in teaching as a comparison tool. There are almost no legitimate use cases where it is the most efficient algorithm. The bubble sort algorithm works by sorting through the array in pairs. It starts at the left&hellip;&nbsp;Read More &raquo;","thumbnail_url":"https:\/\/learnlearn.uk\/edexcel-igcse-computer-science\/wp-content\/uploads\/sites\/27\/2023\/06\/bubble-sort.gif"}