{"title":"降低二分搜索时间复杂度的分解算法","authors":"Kunal, Tushar, G. Chakraborty","doi":"10.17577/IJERTV10IS040081","DOIUrl":null,"url":null,"abstract":"Searching is one of the principal tasks in computer science. Binary Search is one of the most common and efficient algorithms used. Binary Search targets the middle element and checks for the target key in the list. The worstcase Time Complexity of Binary Search is O(log(n)) where n less length of the search list. In this paper, we have proposed a fast and efficient approach to binary Search by decomposing the main search list into multiple search lists. The Time Complexity for the proposed algorithm is O(log(k)) where k < n and n is the length of the sorted list and k is the length of the sub-list.","PeriodicalId":14123,"journal":{"name":"International journal of engineering research and technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Decomposed Algorithm for Reducing Time Complexity in Binary Search\",\"authors\":\"Kunal, Tushar, G. Chakraborty\",\"doi\":\"10.17577/IJERTV10IS040081\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Searching is one of the principal tasks in computer science. Binary Search is one of the most common and efficient algorithms used. Binary Search targets the middle element and checks for the target key in the list. The worstcase Time Complexity of Binary Search is O(log(n)) where n less length of the search list. In this paper, we have proposed a fast and efficient approach to binary Search by decomposing the main search list into multiple search lists. The Time Complexity for the proposed algorithm is O(log(k)) where k < n and n is the length of the sorted list and k is the length of the sub-list.\",\"PeriodicalId\":14123,\"journal\":{\"name\":\"International journal of engineering research and technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of engineering research and technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17577/IJERTV10IS040081\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of engineering research and technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17577/IJERTV10IS040081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
搜索是计算机科学的主要任务之一。二分搜索是最常用和最有效的算法之一。二分查找以中间元素为目标,并检查列表中的目标键。二进制搜索的最坏情况下的时间复杂度是O(log(n)),其中n小于搜索列表的长度。在本文中,我们提出了一种快速有效的二分搜索方法,将主搜索表分解为多个搜索表。本文算法的Time Complexity为O(log(k)),其中k < n, n为排序列表的长度,k为子列表的长度。
Decomposed Algorithm for Reducing Time Complexity in Binary Search
Searching is one of the principal tasks in computer science. Binary Search is one of the most common and efficient algorithms used. Binary Search targets the middle element and checks for the target key in the list. The worstcase Time Complexity of Binary Search is O(log(n)) where n less length of the search list. In this paper, we have proposed a fast and efficient approach to binary Search by decomposing the main search list into multiple search lists. The Time Complexity for the proposed algorithm is O(log(k)) where k < n and n is the length of the sorted list and k is the length of the sub-list.