1.0IGCSE Computer Sciencehttps://learnlearn.uk/igcsecslearnlearnadminhttps://learnlearn.uk/igcsecs/author/learnlearnadmin/rich600338<blockquote class="wp-embedded-content" data-secret="XZ1NAbwqpx"><a href="https://learnlearn.uk/igcsecs/bubble-sort/">Bubble Sort</a></blockquote><iframe sandbox="allow-scripts" security="restricted" src="https://learnlearn.uk/igcsecs/bubble-sort/embed/#?secret=XZ1NAbwqpx" width="600" height="338" title="“Bubble Sort” — IGCSE Computer Science" data-secret="XZ1NAbwqpx" frameborder="0" marginwidth="0" marginheight="0" scrolling="no" class="wp-embedded-content"></iframe><script> /*! This file is auto-generated */ !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); //# sourceURL=https://learnlearn.uk/igcsecs/wp-includes/js/wp-embed.min.js </script> Introduction to Bubble Sort Bubble sort works by iterating through the array repeatedly, comparing adjacent elements and swapping them if they are in the wrong order. The algorithm keeps track of the sorted partition of the array and continues sorting the remaining unsorted partition until the entire array is sorted. This process is repeated until… Read More »https://revise.learnlearn.uk/django-summernote/2023-08-27/177aadce-dec7-40fd-aef2-3033cdecac67.gif