{"id":132532,"date":"2024-08-29T13:09:33","date_gmt":"2024-08-29T10:09:33","guid":{"rendered":"https:\/\/azbuki.bg\/?p=132532"},"modified":"2024-09-03T10:56:41","modified_gmt":"2024-09-03T07:56:41","slug":"on-the-time-complexity-of-an-algorithm","status":"publish","type":"post","link":"https:\/\/newspaper.azbuki.bg\/en\/uncategorized\/on-the-time-complexity-of-an-algorithm\/","title":{"rendered":"On the Time Complexity of an Algorithm"},"content":{"rendered":"<p><strong>Krassimir Manev<\/strong><br \/>\n<em>Journal Mathematics and Informatics \u2013 Sofia (Bulgaria)<\/em><\/p>\n<p><a href=\"https:\/\/doi.org\/10.53656\/math2024-4-2-ont\" target=\"_blank\" rel=\"noopener\">https:\/\/doi.org\/10.53656\/math2024-4-2-ont<\/a><\/p>\n<p><strong>Abstract.<\/strong> 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 students. The task has efficient algorithmic solution but estimation of its time complexity in the worst case is really difficult. We provide corresponding reasoning of the estimated complexity and propose some explanation of it understandable for pupils of that age.<br \/>\n<em>Keywords:<\/em> programming contests, algorithm, subsequence cutting, time complexity of algorithm<\/p>\n<a href=\"https:\/\/newspaper.azbuki.bg\/en\/member-login\/\">Log in to read the full text<\/a>","protected":false},"excerpt":{"rendered":"<p>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;]<\/p>","protected":false},"author":124332423427287,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jnews-multi-image_gallery":[],"jnews_single_post":{"source_name":"","source_url":"","via_name":"","via_url":"","override_template":"0","override":[{"template":"1","single_blog_custom":"","parallax":"1","fullscreen":"1","layout":"right-sidebar","sidebar":"default-sidebar","second_sidebar":"default-sidebar","sticky_sidebar":"1","share_position":"bottom","share_float_style":"share-monocrhome","show_share_counter":"1","show_view_counter":"1","show_featured":"0","show_post_meta":"1","show_post_author":"1","show_post_author_image":"1","show_post_date":"1","post_date_format":"custom","post_date_format_custom":"d-m-Y","show_post_category":"1","show_post_reading_time":"0","post_reading_time_wpm":"300","show_zoom_button":"1","zoom_button_out_step":"2","zoom_button_in_step":"3","show_post_tag":"1","show_prev_next_post":"1","show_popup_post":"1","number_popup_post":"3","show_author_box":"0","show_post_related":"0","show_inline_post_related":"0"}],"override_image_size":"0","image_override":[{"single_post_thumbnail_size":"crop-500","single_post_gallery_size":"crop-500"}],"trending_post":"0","trending_post_position":"meta","trending_post_label":"Trending","sponsored_post":"0","sponsored_post_label":"Sponsored by","sponsored_post_name":"","sponsored_post_url":"","sponsored_post_logo_enable":"0","sponsored_post_logo":"","sponsored_post_desc":"","disable_ad":"0"},"jnews_primary_category":{"id":"","hide":""}},"categories":[1],"tags":[7586,7585,7587,7588],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v21.7 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>On the Time Complexity of an Algorithm - \u0410\u0437-\u0431\u0443\u043a\u0438<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"On the Time Complexity of an Algorithm - \u0410\u0437-\u0431\u0443\u043a\u0438\" \/>\n<meta property=\"og:description\" content=\"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;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/\" \/>\n<meta property=\"og:site_name\" content=\"\u0410\u0437-\u0431\u0443\u043a\u0438\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/Azbuki55\/\" \/>\n<meta property=\"article:published_time\" content=\"2024-08-29T10:09:33+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-09-03T07:56:41+00:00\" \/>\n<meta name=\"author\" content=\"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/\"},\"author\":{\"name\":\"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c\",\"@id\":\"https:\/\/vocedu.azbuki.bg\/en\/#\/schema\/person\/de220d282eaa494f914ce0fd838645dd\"},\"headline\":\"On the Time Complexity of an Algorithm\",\"datePublished\":\"2024-08-29T10:09:33+00:00\",\"dateModified\":\"2024-09-03T07:56:41+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/\"},\"wordCount\":143,\"publisher\":{\"@id\":\"https:\/\/vocedu.azbuki.bg\/en\/#organization\"},\"keywords\":[\"algorithm\",\"programming contests\",\"subsequence cutting\",\"time complexity of algorithm\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/\",\"url\":\"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/\",\"name\":\"On the Time Complexity of an Algorithm - \u0410\u0437-\u0431\u0443\u043a\u0438\",\"isPartOf\":{\"@id\":\"https:\/\/vocedu.azbuki.bg\/en\/#website\"},\"datePublished\":\"2024-08-29T10:09:33+00:00\",\"dateModified\":\"2024-09-03T07:56:41+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/strategies.azbuki.bg\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"On the Time Complexity of an Algorithm\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/vocedu.azbuki.bg\/en\/#website\",\"url\":\"https:\/\/vocedu.azbuki.bg\/en\/\",\"name\":\"\u0410\u0437-\u0431\u0443\u043a\u0438\",\"description\":\"\u041d\u0430\u0446\u0438\u043e\u043d\u0430\u043b\u043d\u043e \u0438\u0437\u0434\u0430\u0442\u0435\u043b\u0441\u0442\u0432\u043e \u0437\u0430 \u043e\u0431\u0440\u0430\u0437\u043e\u0432\u0430\u043d\u0438\u0435 \u0438 \u043d\u0430\u0443\u043a\u0430\",\"publisher\":{\"@id\":\"https:\/\/vocedu.azbuki.bg\/en\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/vocedu.azbuki.bg\/en\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/vocedu.azbuki.bg\/en\/#organization\",\"name\":\"\u0410\u0437-\u0431\u0443\u043a\u0438\",\"url\":\"https:\/\/vocedu.azbuki.bg\/en\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/vocedu.azbuki.bg\/en\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/azbuki.bg\/wp-content\/uploads\/2019\/04\/logo-azbuki-e1580374651845.png\",\"contentUrl\":\"https:\/\/azbuki.bg\/wp-content\/uploads\/2019\/04\/logo-azbuki-e1580374651845.png\",\"width\":250,\"height\":70,\"caption\":\"\u0410\u0437-\u0431\u0443\u043a\u0438\"},\"image\":{\"@id\":\"https:\/\/vocedu.azbuki.bg\/en\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/Azbuki55\/\",\"https:\/\/www.instagram.com\/nion_azbuki\/\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/vocedu.azbuki.bg\/en\/#\/schema\/person\/de220d282eaa494f914ce0fd838645dd\",\"name\":\"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/vocedu.azbuki.bg\/en\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/d08ccbd951212deb604aa2d403575d4e?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/d08ccbd951212deb604aa2d403575d4e?s=96&d=mm&r=g\",\"caption\":\"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c\"},\"sameAs\":[\"https:\/\/azbuki.bg\/\"],\"url\":\"https:\/\/newspaper.azbuki.bg\/en\/author\/azbuki_ekip\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"On the Time Complexity of an Algorithm - \u0410\u0437-\u0431\u0443\u043a\u0438","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/","og_locale":"en_US","og_type":"article","og_title":"On the Time Complexity of an Algorithm - \u0410\u0437-\u0431\u0443\u043a\u0438","og_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;]","og_url":"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/","og_site_name":"\u0410\u0437-\u0431\u0443\u043a\u0438","article_publisher":"https:\/\/www.facebook.com\/Azbuki55\/","article_published_time":"2024-08-29T10:09:33+00:00","article_modified_time":"2024-09-03T07:56:41+00:00","author":"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c","twitter_card":"summary_large_image","twitter_misc":{"Written by":"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/#article","isPartOf":{"@id":"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/"},"author":{"name":"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c","@id":"https:\/\/vocedu.azbuki.bg\/en\/#\/schema\/person\/de220d282eaa494f914ce0fd838645dd"},"headline":"On the Time Complexity of an Algorithm","datePublished":"2024-08-29T10:09:33+00:00","dateModified":"2024-09-03T07:56:41+00:00","mainEntityOfPage":{"@id":"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/"},"wordCount":143,"publisher":{"@id":"https:\/\/vocedu.azbuki.bg\/en\/#organization"},"keywords":["algorithm","programming contests","subsequence cutting","time complexity of algorithm"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/","url":"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/","name":"On the Time Complexity of an Algorithm - \u0410\u0437-\u0431\u0443\u043a\u0438","isPartOf":{"@id":"https:\/\/vocedu.azbuki.bg\/en\/#website"},"datePublished":"2024-08-29T10:09:33+00:00","dateModified":"2024-09-03T07:56:41+00:00","breadcrumb":{"@id":"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/history.azbuki.bg\/uncategorized\/on-the-time-complexity-of-an-algorithm\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/strategies.azbuki.bg\/"},{"@type":"ListItem","position":2,"name":"On the Time Complexity of an Algorithm"}]},{"@type":"WebSite","@id":"https:\/\/vocedu.azbuki.bg\/en\/#website","url":"https:\/\/vocedu.azbuki.bg\/en\/","name":"\u0410\u0437-\u0431\u0443\u043a\u0438","description":"\u041d\u0430\u0446\u0438\u043e\u043d\u0430\u043b\u043d\u043e \u0438\u0437\u0434\u0430\u0442\u0435\u043b\u0441\u0442\u0432\u043e \u0437\u0430 \u043e\u0431\u0440\u0430\u0437\u043e\u0432\u0430\u043d\u0438\u0435 \u0438 \u043d\u0430\u0443\u043a\u0430","publisher":{"@id":"https:\/\/vocedu.azbuki.bg\/en\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/vocedu.azbuki.bg\/en\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/vocedu.azbuki.bg\/en\/#organization","name":"\u0410\u0437-\u0431\u0443\u043a\u0438","url":"https:\/\/vocedu.azbuki.bg\/en\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/vocedu.azbuki.bg\/en\/#\/schema\/logo\/image\/","url":"https:\/\/azbuki.bg\/wp-content\/uploads\/2019\/04\/logo-azbuki-e1580374651845.png","contentUrl":"https:\/\/azbuki.bg\/wp-content\/uploads\/2019\/04\/logo-azbuki-e1580374651845.png","width":250,"height":70,"caption":"\u0410\u0437-\u0431\u0443\u043a\u0438"},"image":{"@id":"https:\/\/vocedu.azbuki.bg\/en\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/Azbuki55\/","https:\/\/www.instagram.com\/nion_azbuki\/"]},{"@type":"Person","@id":"https:\/\/vocedu.azbuki.bg\/en\/#\/schema\/person\/de220d282eaa494f914ce0fd838645dd","name":"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/vocedu.azbuki.bg\/en\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/d08ccbd951212deb604aa2d403575d4e?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/d08ccbd951212deb604aa2d403575d4e?s=96&d=mm&r=g","caption":"\u201e\u0410\u0437-\u0431\u0443\u043a\u0438\u201c"},"sameAs":["https:\/\/azbuki.bg\/"],"url":"https:\/\/newspaper.azbuki.bg\/en\/author\/azbuki_ekip\/"}]}},"_links":{"self":[{"href":"https:\/\/newspaper.azbuki.bg\/en\/wp-json\/wp\/v2\/posts\/132532"}],"collection":[{"href":"https:\/\/newspaper.azbuki.bg\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/newspaper.azbuki.bg\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/newspaper.azbuki.bg\/en\/wp-json\/wp\/v2\/users\/124332423427287"}],"replies":[{"embeddable":true,"href":"https:\/\/newspaper.azbuki.bg\/en\/wp-json\/wp\/v2\/comments?post=132532"}],"version-history":[{"count":3,"href":"https:\/\/newspaper.azbuki.bg\/en\/wp-json\/wp\/v2\/posts\/132532\/revisions"}],"predecessor-version":[{"id":132725,"href":"https:\/\/newspaper.azbuki.bg\/en\/wp-json\/wp\/v2\/posts\/132532\/revisions\/132725"}],"wp:attachment":[{"href":"https:\/\/newspaper.azbuki.bg\/en\/wp-json\/wp\/v2\/media?parent=132532"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/newspaper.azbuki.bg\/en\/wp-json\/wp\/v2\/categories?post=132532"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/newspaper.azbuki.bg\/en\/wp-json\/wp\/v2\/tags?post=132532"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}