{"version":"1.0","provider_name":"\u0410\u0437-\u0431\u0443\u043a\u0438","provider_url":"https:\/\/newspaper.azbuki.bg\/en\/","author_name":"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c","author_url":"https:\/\/newspaper.azbuki.bg\/en\/author\/azbuki_ekip\/","title":"On the Time Complexity of an Algorithm - \u0410\u0437-\u0431\u0443\u043a\u0438","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"s74MZxjjCn\"><a href=\"https:\/\/newspaper.azbuki.bg\/en\/uncategorized\/on-the-time-complexity-of-an-algorithm\/\">On the Time Complexity of an Algorithm<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/newspaper.azbuki.bg\/en\/uncategorized\/on-the-time-complexity-of-an-algorithm\/embed\/#?secret=s74MZxjjCn\" width=\"600\" height=\"338\" title=\"&#8220;On the Time Complexity of an Algorithm&#8221; &#8212; \u0410\u0437-\u0431\u0443\u043a\u0438\" data-secret=\"s74MZxjjCn\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script type=\"text\/javascript\">\n\/*! This file is auto-generated *\/\n!function(c,d){\"use strict\";var e=!1,o=!1;if(d.querySelector)if(c.addEventListener)e=!0;if(c.wp=c.wp||{},c.wp.receiveEmbedMessage);else if(c.wp.receiveEmbedMessage=function(e){var t=e.data;if(!t);else if(!(t.secret||t.message||t.value));else if(\/[^a-zA-Z0-9]\/.test(t.secret));else{for(var r,s,a,i=d.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),n=d.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),o=new RegExp(\"^https?:$\",\"i\"),l=0;l<n.length;l++)n[l].style.display=\"none\";for(l=0;l<i.length;l++)if(r=i[l],e.source!==r.contentWindow);else{if(r.removeAttribute(\"style\"),\"height\"===t.message){if(1e3<(s=parseInt(t.value,10)))s=1e3;else if(~~s<200)s=200;r.height=s}if(\"link\"===t.message)if(s=d.createElement(\"a\"),a=d.createElement(\"a\"),s.href=r.getAttribute(\"src\"),a.href=t.value,!o.test(a.protocol));else if(a.host===s.host)if(d.activeElement===r)c.top.location.href=t.value}}},e)c.addEventListener(\"message\",c.wp.receiveEmbedMessage,!1),d.addEventListener(\"DOMContentLoaded\",t,!1),c.addEventListener(\"load\",t,!1);function t(){if(o);else{o=!0;for(var e,t,r,s=-1!==navigator.appVersion.indexOf(\"MSIE 10\"),a=!!navigator.userAgent.match(\/Trident.*rv:11\\.\/),i=d.querySelectorAll(\"iframe.wp-embedded-content\"),n=0;n<i.length;n++){if(!(r=(t=i[n]).getAttribute(\"data-secret\")))r=Math.random().toString(36).substr(2,10),t.src+=\"#?secret=\"+r,t.setAttribute(\"data-secret\",r);if(s||a)(e=t.cloneNode(!0)).removeAttribute(\"security\"),t.parentNode.replaceChild(e,t);t.contentWindow.postMessage({message:\"ready\",secret:r},\"*\")}}}}(window,document);\n<\/script>\n","description":"Krassimir Manev Journal Mathematics and Informatics \u2013 Sofia (Bulgaria) https:\/\/doi.org\/10.53656\/math2024-4-2-ont Abstract. The difficulty of estimation the time complexity of an algorithm in the worst case is not always the same as the mathematical complexity of the solved task. In this paper we demonstrate a mathematically clear task proposed in a programming contest for Grade 6 [&hellip;]"}