\n
A code with \u03b8(n) and \u03b8(n2<\/sup>) complexity . Which code will execute faster for a code of size J ?<\/p>\n\n
\n
A. \u03b8(n)<\/p>\n<\/div>\n
\n
B. \u03b8(n2<\/sup>)<\/p>\n<\/div>\n\n
C. Cant be said as size of K is unknown<\/p>\n<\/div>\n
\n
D. Both will be equal<\/p>\n<\/div>\n<\/div>\n
Answer :\u00a0<\/b>C. Cant be said as size of K is unknown<\/h3>\n<\/div>\n<\/div>\n\n
Explanation :<\/h2>\n<\/div>\n\n
\n
Cant be determined as the size of K is not known.<\/p>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
Answer :\u00a0C. Cant be said as size of K is unknown<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"passster_activate_protection":false,"passster_protect_child_pages":"","passster_protection_type":"password","passster_password":"","passster_activate_overwrite_defaults":"","passster_headline":"","passster_instruction":"","passster_placeholder":"","passster_button":"","passster_id":"","passster_activate_misc_settings":"","passster_redirect_url":"","passster_hide":"no","passster_area_shortcode":"","gtb_hide_title":false,"gtb_wrap_title":false,"gtb_class_title":"","gtb_remove_headerfooter":false,"footnotes":""},"categories":[15949],"tags":[16209,16210,16211,16213,3127,3126,16218,16220,16219,16212,16214,16276,16215,15957,16216,16217],"class_list":["post-2590","post","type-post","status-publish","format-standard","hentry","category-programming","tag-a-code-with-n-and-n2","tag-a-code-with-n-and-n2-complexity","tag-algorithm-big-o","tag-algorithm-determining-the-big-o-runtimes-of-these","tag-big-theta-examples","tag-big-theta-notation-examples","tag-codes-a-and-b-have-complexities","tag-complexity-theory-in-oops","tag-complexity-theory-in-oops-questions","tag-how-do-you-calculate-approximate-it","tag-how-to-find-time-complexity-of-an-algorithm","tag-most-asked-sapient-nitro-interview-questions","tag-on-always-faster-than-on2","tag-object-oriented-programming-in-java-questions-and-answers","tag-time-complexity-what-does-olog-n-mean-exactly","tag-which-code-will-execute-faster-for-a-code-of-size-j"],"yoast_head":"\n
A code with \u03b8(n) and \u03b8(n2) complexity - Programming - Wikitechy<\/title>\n<meta name=\"description\" content=\"A code with \u03b8(n) and \u03b8(n2) complexity. Which code will execute faster for a code of size J ? - Cant be determined as the size of K is not known.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.wikitechy.com\/interview-questions\/programming\/a-code-with-\u03b8n-and-\u03b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"A code with \u03b8(n) and \u03b8(n2) complexity - Programming - Wikitechy\" \/>\n<meta property=\"og:description\" content=\"A code with \u03b8(n) and \u03b8(n2) complexity. Which code will execute faster for a code of size J ? - Cant be determined as the size of K is not known.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.wikitechy.com\/interview-questions\/programming\/a-code-with-\u03b8n-and-\u03b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j\/\" \/>\n<meta property=\"og:site_name\" content=\"Wikitechy\" \/>\n<meta property=\"article:published_time\" content=\"2021-08-27T00:49:36+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2021-09-03T06:36:30+00:00\" \/>\n<meta name=\"author\" content=\"Editor\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Editor\" \/>\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\":\"WebPage\",\"@id\":\"https:\/\/www.wikitechy.com\/interview-questions\/programming\/a-code-with-%ce%b8n-and-%ce%b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j\/\",\"url\":\"https:\/\/www.wikitechy.com\/interview-questions\/programming\/a-code-with-%ce%b8n-and-%ce%b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j\/\",\"name\":\"A code with \u03b8(n) and \u03b8(n2) complexity - Programming - Wikitechy\",\"isPartOf\":{\"@id\":\"https:\/\/www.wikitechy.com\/interview-questions\/#website\"},\"datePublished\":\"2021-08-27T00:49:36+00:00\",\"dateModified\":\"2021-09-03T06:36:30+00:00\",\"author\":{\"@id\":\"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/4d5a581fb5470d1560324bddc5e8b757\"},\"description\":\"A code with \u03b8(n) and \u03b8(n2) complexity. Which code will execute faster for a code of size J ? - Cant be determined as the size of K is not known.\",\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.wikitechy.com\/interview-questions\/programming\/a-code-with-%ce%b8n-and-%ce%b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j\/\"]}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.wikitechy.com\/interview-questions\/#website\",\"url\":\"https:\/\/www.wikitechy.com\/interview-questions\/\",\"name\":\"Wikitechy\",\"description\":\"Interview Questions\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.wikitechy.com\/interview-questions\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/4d5a581fb5470d1560324bddc5e8b757\",\"name\":\"Editor\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g\",\"caption\":\"Editor\"},\"url\":\"https:\/\/www.wikitechy.com\/interview-questions\/author\/editor\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"A code with \u03b8(n) and \u03b8(n2) complexity - Programming - Wikitechy","description":"A code with \u03b8(n) and \u03b8(n2) complexity. Which code will execute faster for a code of size J ? - Cant be determined as the size of K is not known.","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:\/\/www.wikitechy.com\/interview-questions\/programming\/a-code-with-\u03b8n-and-\u03b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j\/","og_locale":"en_US","og_type":"article","og_title":"A code with \u03b8(n) and \u03b8(n2) complexity - Programming - Wikitechy","og_description":"A code with \u03b8(n) and \u03b8(n2) complexity. Which code will execute faster for a code of size J ? - Cant be determined as the size of K is not known.","og_url":"https:\/\/www.wikitechy.com\/interview-questions\/programming\/a-code-with-\u03b8n-and-\u03b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j\/","og_site_name":"Wikitechy","article_published_time":"2021-08-27T00:49:36+00:00","article_modified_time":"2021-09-03T06:36:30+00:00","author":"Editor","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Editor","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.wikitechy.com\/interview-questions\/programming\/a-code-with-%ce%b8n-and-%ce%b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j\/","url":"https:\/\/www.wikitechy.com\/interview-questions\/programming\/a-code-with-%ce%b8n-and-%ce%b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j\/","name":"A code with \u03b8(n) and \u03b8(n2) complexity - Programming - Wikitechy","isPartOf":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/#website"},"datePublished":"2021-08-27T00:49:36+00:00","dateModified":"2021-09-03T06:36:30+00:00","author":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/4d5a581fb5470d1560324bddc5e8b757"},"description":"A code with \u03b8(n) and \u03b8(n2) complexity. Which code will execute faster for a code of size J ? - Cant be determined as the size of K is not known.","inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.wikitechy.com\/interview-questions\/programming\/a-code-with-%ce%b8n-and-%ce%b8n2-complexity-which-code-will-execute-faster-for-a-code-of-size-j\/"]}]},{"@type":"WebSite","@id":"https:\/\/www.wikitechy.com\/interview-questions\/#website","url":"https:\/\/www.wikitechy.com\/interview-questions\/","name":"Wikitechy","description":"Interview Questions","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.wikitechy.com\/interview-questions\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/4d5a581fb5470d1560324bddc5e8b757","name":"Editor","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g","caption":"Editor"},"url":"https:\/\/www.wikitechy.com\/interview-questions\/author\/editor\/"}]}},"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts\/2590","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/comments?post=2590"}],"version-history":[{"count":1,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts\/2590\/revisions"}],"predecessor-version":[{"id":2597,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts\/2590\/revisions\/2597"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/media?parent=2590"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/categories?post=2590"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/tags?post=2590"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}