<?xml version="1.0"?>
<oembed><version>1.0</version><provider_name>GCSE Computer Science Theory</provider_name><provider_url>https://learnlearn.uk/gcsecs</provider_url><author_name>learnlearnadmin</author_name><author_url>https://learnlearn.uk/gcsecs/author/learnlearnadmin/</author_url><title>Sorting algorithms - GCSE Computer Science Theory</title><type>rich</type><width>600</width><height>338</height><html>&lt;blockquote class="wp-embedded-content" data-secret="shIrtIiDTS"&gt;&lt;a href="https://learnlearn.uk/gcsecs/sorting-algorithms/"&gt;Sorting algorithms&lt;/a&gt;&lt;/blockquote&gt;&lt;iframe sandbox="allow-scripts" security="restricted" src="https://learnlearn.uk/gcsecs/sorting-algorithms/embed/#?secret=shIrtIiDTS" width="600" height="338" title="&#x201C;Sorting algorithms&#x201D; &#x2014; GCSE Computer Science Theory" data-secret="shIrtIiDTS" frameborder="0" marginwidth="0" marginheight="0" scrolling="no" class="wp-embedded-content"&gt;&lt;/iframe&gt;&lt;script&gt;
/*! This file is auto-generated */
!function(d,l){"use strict";l.querySelector&amp;&amp;d.addEventListener&amp;&amp;"undefined"!=typeof URL&amp;&amp;(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&amp;&amp;!/[^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&lt;o.length;i++)o[i].style.display="none";for(i=0;i&lt;a.length;i++)s=a[i],e.source===s.contentWindow&amp;&amp;(s.removeAttribute("style"),"height"===t.message?(1e3&lt;(r=parseInt(t.value,10))?r=1e3:~~r&lt;200&amp;&amp;(r=200),s.height=r):"link"===t.message&amp;&amp;(r=new URL(s.getAttribute("src")),n=new URL(t.value),c.test(n.protocol))&amp;&amp;n.host===r.host&amp;&amp;l.activeElement===s&amp;&amp;(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&lt;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/gcsecs/wp-includes/js/wp-embed.min.js
&lt;/script&gt;
</html><description>Have a go at this sorting game. How quickly can you sort all the letters just by clicking on letters to swap? Insertion Sort With the insertion sort algorithm, you go through each item in the list in turn and move to its correct position in the list. The algorithm is slow but simple. Insertion&hellip;&nbsp;Read More &raquo;</description><thumbnail_url>http://learnlearn.uk/algorithms/wp-content/uploads/sites/12/2017/01/sort-271x300.png</thumbnail_url></oembed>
