{"id":25217,"date":"2017-10-15T15:45:25","date_gmt":"2017-10-15T10:15:25","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25217"},"modified":"2017-10-15T15:45:25","modified_gmt":"2017-10-15T10:15:25","slug":"interpolation-search-vs-binary-search","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/interpolation-search-vs-binary-search\/","title":{"rendered":"Interpolation search vs Binary search"},"content":{"rendered":"<header class=\"entry-header\">\n<p class=\"entry-title\">Interpolation search works better than Binary Search for a sorted and uniformly distributed array.<\/p>\n<\/header>\n<div class=\"entry-content\">\n<p>&nbsp;<\/p>\n<p>On average the interpolation search makes about log(log(n)) comparisons (if the elements are uniformly distributed), where n is the number of elements to be searched. In the worst case (for instance where the numerical values of the keys increase exponentially) it can make up to O(n) comparisons.<\/p>\n<p>Interpolation Search Article<\/p>\n[ad type=&#8221;banner&#8221;]\n<p>&nbsp;<\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Interpolation search vs Binary search &#8211; Searching and Sorting &#8211; On average the interpolation search makes about log(log(n)) comparisons(if the elements are uniformly distributed), where n is the number of elements to be searched. <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[82509,83509,71670],"tags":[70276,70058,70283,70921,70052,70264,70282,70304,70076,70081,70270,70113,70269,70275,70265,70321,70273,70116,70077,70028,70306,70067,72208,72207,70749,72210,70274,70496,70018,70035,70059,70745,70070,70761,70095,70084,70073,70272,72206,70099,70114,70097,70106,70315,72209,70709,70308,70072,70105,70062,70317,70087,70026,70108,70100,72211,70101],"class_list":["post-25217","post","type-post","status-publish","format-standard","hentry","category-binary-search-tree-2","category-interpolation-search","category-searching-and-sorting","tag-algorithm-for-binary-search","tag-algorithm-for-linear-search","tag-algorithm-of-binary-search","tag-best-search-algorithm","tag-binary-search","tag-binary-search-algorithm","tag-binary-search-algorithm-example","tag-binary-search-algorithm-in-c","tag-binary-search-c","tag-binary-search-complexity","tag-binary-search-in-c","tag-binary-search-in-c-program","tag-binary-search-in-java","tag-binary-search-java","tag-binary-search-program-in-c","tag-binary-search-program-in-cpp","tag-binary-sort","tag-c-program-for-binary-search","tag-c-program-for-linear-search","tag-complexity-of-binary-search","tag-complexity-of-binary-search-algorithm","tag-complexity-of-linear-search-algorithm","tag-define-search","tag-fibonacci-search","tag-interpolation","tag-interpolation-search","tag-java-binary-search","tag-linear-search","tag-linear-search-algorithm","tag-linear-search-algorithm-in-c","tag-linear-search-algorithm-in-data-structure","tag-linear-search-in-c","tag-linear-search-program","tag-linear-search-program-in-c","tag-linear-search-program-in-java","tag-list-of-search-algorithms","tag-program-for-linear-search","tag-search-algorithms","tag-search-engine-algorithm","tag-search-inc","tag-search-techniques","tag-searching-algorithms-in-c","tag-searching-algorithms-in-data-structure","tag-searching-algorithms-in-java","tag-searching-and-sorting-in-c","tag-searching-and-sorting-in-data-structure","tag-searching-c","tag-searching-in-data-structure","tag-searching-techniques-in-data-structure","tag-sequential-search-algorithm","tag-the-complexity-of-binary-search-algorithm-is","tag-the-complexity-of-linear-search-algorithm-is","tag-time-complexity-of-binary-search","tag-types-of-searching-algorithms","tag-types-of-searching-in-data-structure","tag-what-is-interpolation","tag-what-is-searching-in-data-structure"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25217","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=25217"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25217\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25217"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25217"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25217"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}