{"version":"1.0","provider_name":"InnovationM - Blog","provider_url":"https:\/\/www.innovationm.com\/blog","author_name":"InnovationM Admin","author_url":"https:\/\/www.innovationm.com\/blog\/author\/innovationmadmin\/","title":"BLOG ON TIME COMPLEXITY OF ALGORITHM - InnovationM - Blog","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"tLB0xdCxUB\"><a href=\"https:\/\/www.innovationm.com\/blog\/blog-on-time-complexity-of-algorithm\/\">BLOG ON TIME COMPLEXITY OF ALGORITHM<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/www.innovationm.com\/blog\/blog-on-time-complexity-of-algorithm\/embed\/#?secret=tLB0xdCxUB\" width=\"600\" height=\"338\" title=\"&#8220;BLOG ON TIME COMPLEXITY OF ALGORITHM&#8221; &#8212; InnovationM - Blog\" data-secret=\"tLB0xdCxUB\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script type=\"text\/javascript\">\n\/* <![CDATA[ *\/\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\/* ]]> *\/\n<\/script>\n","thumbnail_url":"https:\/\/www.innovationm.com\/blog\/wp-content\/uploads\/2022\/10\/Time-Complexity-of-Algorithm.png","thumbnail_width":1689,"thumbnail_height":950,"description":"What is Time Complexity? Time Complexity is the time consumed by the algorithm to complete its execution. Time Complexity is measured by summing the time of all the elementary operations. There are many notations to represent the time complexity like:- (1)Big Oh, O (2)Omega, \u03a9 (3)Theta, \u0398 But, the most commonly used notation for Time [&hellip;]"}