{"version":"1.0","provider_name":"JassWeb","provider_url":"https:\/\/jassweb.com\/solved","author_name":"Kirat","author_url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/","title":"[Solved] Greatest common divisor algorithms OTHER than Euclid's - JassWeb","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"5buXInPHzS\"><a href=\"https:\/\/jassweb.com\/solved\/solved-greatest-common-divisor-algorithms-other-than-euclids\/\">[Solved] Greatest common divisor algorithms OTHER than Euclid&#8217;s<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/jassweb.com\/solved\/solved-greatest-common-divisor-algorithms-other-than-euclids\/embed\/#?secret=5buXInPHzS\" width=\"600\" height=\"338\" title=\"&#8220;[Solved] Greatest common divisor algorithms OTHER than Euclid&#8217;s&#8221; &#8212; JassWeb\" data-secret=\"5buXInPHzS\" 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:\/\/jassweb.com\/solved\/wp-includes\/js\/wp-embed.min.js\n<\/script>\n","description":"[ad_1] (Note that when computing gcd(a,b), we can assume that a &lt;= b; if that were not true, we could just swap them.) The Euclidean algorithm is certainly the most efficient way to compute the gcd. But if you need two other (inefficient) ways to compute gcd(a,b), there are plenty: Starting from a and going ... Read more"}