New and improved search algorithms and precise analysis of their average-case complexity
In this paper, we consider the searching problem over ordered sequences. It is well known that Binary Search (BS) algorithm solves this problem with very efficient complexity, namely with the complexity θ(log2n). The developments of the BS algorithm, such as Ternary Search (TS) algorithm do not impr...
Saved in:
| Published in: | Future generation computer systems Vol. 95; pp. 743 - 753 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.06.2019
|
| Subjects: | |
| ISSN: | 0167-739X, 1872-7115 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In this paper, we consider the searching problem over ordered sequences. It is well known that Binary Search (BS) algorithm solves this problem with very efficient complexity, namely with the complexity θ(log2n). The developments of the BS algorithm, such as Ternary Search (TS) algorithm do not improve the efficiency. The rapid increase in the amount of data has made the search problem more important than in the past. And this made it important to reduce average number of comparisons in cases where the asymptotic improvement is not achieved. In this paper, we identify and analyze an implementation issue of BS. Depending on the location of the conditional operators, we classify two different implementations for BS which are widely used in the literature. We call these two implementations weak and correct implementations. We calculate precise number of comparisons in average case for both implementations. Moreover, we transform the TS algorithm into an improved ternary search (ITS) algorithm. We also propose a new Binary–Quaternary Search (BQS) algorithm by using a novel dividing strategy. We prove that an average number of comparisons for both presented algorithms ITS and BQS is less than for the case of correct implementation of the BS algorithm. We also provide the experimental results.
•We propose improved ternary search (ITS) algorithm.•We also propose a new Binary–Quaternary Search (BQS) algorithm.•We discuss weak and correct implementations of the binary search (BS) algorithm.•We calculate average number of comparisons for weak and correct implementations of the BS algorithm precisely.•We calculate average number of comparisons for the ITS and BQS algorithms precisely. |
|---|---|
| AbstractList | In this paper, we consider the searching problem over ordered sequences. It is well known that Binary Search (BS) algorithm solves this problem with very efficient complexity, namely with the complexity θ(log2n). The developments of the BS algorithm, such as Ternary Search (TS) algorithm do not improve the efficiency. The rapid increase in the amount of data has made the search problem more important than in the past. And this made it important to reduce average number of comparisons in cases where the asymptotic improvement is not achieved. In this paper, we identify and analyze an implementation issue of BS. Depending on the location of the conditional operators, we classify two different implementations for BS which are widely used in the literature. We call these two implementations weak and correct implementations. We calculate precise number of comparisons in average case for both implementations. Moreover, we transform the TS algorithm into an improved ternary search (ITS) algorithm. We also propose a new Binary–Quaternary Search (BQS) algorithm by using a novel dividing strategy. We prove that an average number of comparisons for both presented algorithms ITS and BQS is less than for the case of correct implementation of the BS algorithm. We also provide the experimental results.
•We propose improved ternary search (ITS) algorithm.•We also propose a new Binary–Quaternary Search (BQS) algorithm.•We discuss weak and correct implementations of the binary search (BS) algorithm.•We calculate average number of comparisons for weak and correct implementations of the BS algorithm precisely.•We calculate average number of comparisons for the ITS and BQS algorithms precisely. |
| Author | Çelebi, Fatih V. Mohammed, Adnan Saher Emrah Amrahov, Şahin |
| Author_xml | – sequence: 1 givenname: Şahin surname: Emrah Amrahov fullname: Emrah Amrahov, Şahin email: emrah@eng.ankara.edu.tr organization: Computer Engineering Department, Ankara University, 06830, Turkey – sequence: 2 givenname: Adnan Saher orcidid: 0000-0002-4539-2867 surname: Mohammed fullname: Mohammed, Adnan Saher organization: Department of Computer Engineering Technologies, College of Engineering Technique, Al-Kitab University, Kirkuk, Iraq – sequence: 3 givenname: Fatih V. surname: Çelebi fullname: Çelebi, Fatih V. organization: Computer Engineering Department, Faculty of Engineering and Natural Sciences, Ankara Yıldırım Beyazıt University, Ankara, Turkey |
| BookMark | eNqFkMtOwzAQRS1UJErhD1jkBxL8iJOYBRKqeEkVbEDqznKccesqiSPbLfTvSSkrFrCake6cK805R5Pe9YDQFcEZwaS43mRmG7ceMoqJyDDJcM5O0JRUJU1LQvgETcezMi2ZWJ6h8xA2GGNSMjJFyxf4SFTfJLYbvNtBkwRQXq8T1a6ct3Hdhe948KBtgHFX7T7YkDiTxDVYn6gdeLWCVKsx1q4bWvi0cX-BTo1qA1z-zBl6f7h_mz-li9fH5_ndItUMFzEVggIvda0MpZQJpitQNeOcVabgpDKCN0zQAkhOccEN57UBQTkpGlPXeU3ZDN0ce7V3IXgwUtuoonV99Mq2kmB5cCQ38uhIHhxJTOToaITzX_Dgbaf8_j_s9ojB-NjOgpdBW-g1NHbUFGXj7N8FXyKphvU |
| CitedBy_id | crossref_primary_10_1016_j_jestch_2021_02_009 crossref_primary_10_1016_j_future_2024_03_049 crossref_primary_10_2478_acss_2022_0010 crossref_primary_10_1016_j_future_2020_09_032 |
| Cites_doi | 10.1016/j.patrec.2012.06.008 10.1007/s00453-015-0041-7 10.1002/rsa.20524 10.1007/s00224-005-1237-z 10.1002/rsa.20497 10.1016/j.tcs.2003.06.001 10.1016/j.dam.2011.05.010 10.1145/2629340 10.3390/sym9090176 10.1145/52965.53012 10.1016/j.future.2017.01.034 10.1016/j.future.2018.04.038 10.1016/S0020-0190(03)00263-1 10.1016/j.ipl.2013.10.010 10.1007/s00453-001-0097-4 10.1007/s00453-007-9088-4 10.1016/j.jda.2014.12.007 |
| ContentType | Journal Article |
| Copyright | 2019 Elsevier B.V. |
| Copyright_xml | – notice: 2019 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.future.2019.01.043 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-7115 |
| EndPage | 753 |
| ExternalDocumentID | 10_1016_j_future_2019_01_043 S0167739X18319307 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 29H 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W KOM LG9 M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SES SEW SPC SPCBC SSV SSZ T5K UHS WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ADNMO AEIPS AFJKZ AGQPQ AIIUN ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c306t-992e57cbaf222393c8eab35538f6518f95d3926e142065f55bfe92516dfbb4b23 |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000465509600060&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-739X |
| IngestDate | Sat Nov 29 02:59:49 EST 2025 Tue Nov 18 22:23:49 EST 2025 Fri Feb 23 02:30:19 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Ternary search Binary search Average-case complexity Searching algorithm |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c306t-992e57cbaf222393c8eab35538f6518f95d3926e142065f55bfe92516dfbb4b23 |
| ORCID | 0000-0002-4539-2867 |
| PageCount | 11 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_future_2019_01_043 crossref_primary_10_1016_j_future_2019_01_043 elsevier_sciencedirect_doi_10_1016_j_future_2019_01_043 |
| PublicationCentury | 2000 |
| PublicationDate | June 2019 2019-06-00 |
| PublicationDateYYYYMMDD | 2019-06-01 |
| PublicationDate_xml | – month: 06 year: 2019 text: June 2019 |
| PublicationDecade | 2010 |
| PublicationTitle | Future generation computer systems |
| PublicationYear | 2019 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Carmo, Donadelli, Kohayakawa, Laber (b24) 2004; 321 Bender, Farach-Colton, Mosteiro (b27) 2006; 397 Hadjicostas, Lakshmanan (b6) 2011; 159 Miller, Ranum (b37) 2013 Chang (b35) 2003 Dymora, Mazurek, Strzaka (b15) 2014; 90 Karumanchi (b40) 2017 Lovro, Binary Search Woźniak, Marszałek, Gabryel, Nowicki (b12) 2013; vol. 7895 Ruggieri (b33) 2003; 87 Woźniak, Z. Marszałek (b17) 2014; vol. 465 Mohammed, Emrah Amrahov, Çelebi (b26) 2017 Neininger (b8) 2015; 46 Marszałek (b11) 2017; 9 Napoli, Pappalardo, Tramontana, Marszałek, Poap, Woźniak (b16) 2014 Miller, Ranum (b38) 2011 Network (b42) 2016 Mohammed, Emrah Amrahov, Çelebi (b1) 2017; 71 Chadha, Misal, Mokashi (b21) 2014 Levitin (b41) 2012 Wild, Nebel, Neininger (b9) 2015; 11 Gao, Wang, Tang, Yin, Ni, Shen (b29) 2017 Marszałek (b13) 2016; vol. 639 Nebel, Wild, Conrado Martínez (b7) 2016; 75 Ambainis, Bloch, Schweizer (b19) 2002; 32 Bonasera, Ferrara, Fiumara, Pagano, Provetti (b25) 2015; 30 . Skiena (b39) 2008 Fredman (b3) 2014; 114 Fuchs (b4) 2015; 46 Woźniak, Marszałek, Gabryel, Nowicki (b14) 2016; vol. 364 Abu Dalhoum, Kobbay, Sleit (b2) 2012; 19 Rahim, Nurarif, Ramadhan, Aisyah, Purba (b22) 2017; 930 Das, Khilar (b18) 2013; 1 Kumar (b23) 2013; 65 Finocchi, Italiano (b20) 2008; 52 Sedgewick, Flajolet (b28) 2013 Knuth (b31) 1998; vol. 3 Pattis (b32) 1988; 20 Hatamlou (b30) 2012; 33 Grabowski, Strzalka (b5) 2006; 72 Bentley (b34) 2000 Goel, Kumar (b10) 2018; 86 Ruggieri (10.1016/j.future.2019.01.043_b33) 2003; 87 Network (10.1016/j.future.2019.01.043_b42) 2016 Fredman (10.1016/j.future.2019.01.043_b3) 2014; 114 Fuchs (10.1016/j.future.2019.01.043_b4) 2015; 46 Hatamlou (10.1016/j.future.2019.01.043_b30) 2012; 33 Bentley (10.1016/j.future.2019.01.043_b34) 2000 Neininger (10.1016/j.future.2019.01.043_b8) 2015; 46 Goel (10.1016/j.future.2019.01.043_b10) 2018; 86 Woźniak (10.1016/j.future.2019.01.043_b12) 2013; vol. 7895 Gao (10.1016/j.future.2019.01.043_b29) 2017 Mohammed (10.1016/j.future.2019.01.043_b26) 2017 Bonasera (10.1016/j.future.2019.01.043_b25) 2015; 30 Chang (10.1016/j.future.2019.01.043_b35) 2003 Chadha (10.1016/j.future.2019.01.043_b21) 2014 Marszałek (10.1016/j.future.2019.01.043_b13) 2016; vol. 639 Woźniak (10.1016/j.future.2019.01.043_b17) 2014; vol. 465 Carmo (10.1016/j.future.2019.01.043_b24) 2004; 321 Miller (10.1016/j.future.2019.01.043_b38) 2011 Woźniak (10.1016/j.future.2019.01.043_b14) 2016; vol. 364 Sedgewick (10.1016/j.future.2019.01.043_b28) 2013 Grabowski (10.1016/j.future.2019.01.043_b5) 2006; 72 10.1016/j.future.2019.01.043_b36 Miller (10.1016/j.future.2019.01.043_b37) 2013 Ambainis (10.1016/j.future.2019.01.043_b19) 2002; 32 Mohammed (10.1016/j.future.2019.01.043_b1) 2017; 71 Marszałek (10.1016/j.future.2019.01.043_b11) 2017; 9 Karumanchi (10.1016/j.future.2019.01.043_b40) 2017 Levitin (10.1016/j.future.2019.01.043_b41) 2012 Finocchi (10.1016/j.future.2019.01.043_b20) 2008; 52 Bender (10.1016/j.future.2019.01.043_b27) 2006; 397 Abu Dalhoum (10.1016/j.future.2019.01.043_b2) 2012; 19 Rahim (10.1016/j.future.2019.01.043_b22) 2017; 930 Knuth (10.1016/j.future.2019.01.043_b31) 1998; vol. 3 Das (10.1016/j.future.2019.01.043_b18) 2013; 1 Skiena (10.1016/j.future.2019.01.043_b39) 2008 Kumar (10.1016/j.future.2019.01.043_b23) 2013; 65 Pattis (10.1016/j.future.2019.01.043_b32) 1988; 20 Napoli (10.1016/j.future.2019.01.043_b16) 2014 Hadjicostas (10.1016/j.future.2019.01.043_b6) 2011; 159 Dymora (10.1016/j.future.2019.01.043_b15) 2014; 90 Nebel (10.1016/j.future.2019.01.043_b7) 2016; 75 Wild (10.1016/j.future.2019.01.043_b9) 2015; 11 |
| References_xml | – volume: 30 start-page: 128 year: 2015 end-page: 133 ident: b25 article-title: Adaptive search over sorted sets publication-title: J. Discrete Algorithms – volume: 321 start-page: 41 year: 2004 end-page: 57 ident: b24 article-title: Searching in random partially ordered sets publication-title: Theoret. Comput. Sci. – reference: Lovro, Binary Search, – volume: 32 start-page: 641 year: 2002 end-page: 651 ident: b19 article-title: Delayed binary search, or playing twenty questions with a procrastinator publication-title: Algorithmica – volume: 86 start-page: 266 year: 2018 end-page: 280 ident: b10 article-title: Brownian motus and clustered binary insertion sort methods: an efficient progress over traditional methods publication-title: Future Gener. Comput. Syst. – volume: 114 start-page: 137 year: 2014 end-page: 139 ident: b3 article-title: An intuitive and simple bounding argument for Quicksort publication-title: Inform. Process. Lett. – year: 2014 ident: b21 article-title: Modified Binary Search Algorithm – volume: 71 start-page: 102 year: 2017 end-page: 112 ident: b1 article-title: Bidirectional conditional insertion sort algorithm; an efficient progress on the classical insertion sort publication-title: Future Gener. Comput. Syst. – volume: 52 start-page: 309 year: 2008 end-page: 332 ident: b20 article-title: Sorting and searching in faulty memories publication-title: Algorithmica – volume: 19 start-page: 543 year: 2012 end-page: 552 ident: b2 article-title: Enhancing QuickSort algorithm using a dynamic pivot selection technique publication-title: Wulfenia – volume: 9 start-page: 176 year: 2017 ident: b11 article-title: Parallelization of modified merge sort algorithm publication-title: Symmetry – year: 2017 ident: b40 article-title: Data Structures and Algorithms Made Easy – start-page: 1 year: 2014 end-page: 8 ident: b16 article-title: Implified firefly algorithm for 2d image key-points search publication-title: Computational Intelligence for Human-Like Intelligence (CIHLI), 2014 IEEE Symposium on – volume: 159 start-page: 1398 year: 2011 end-page: 1417 ident: b6 article-title: Recursive merge sort with erroneous comparisons publication-title: Discrete Appl. Math. – volume: 930 year: 2017 ident: b22 article-title: Comparison searching process of linear, binary and interpolation algorithm publication-title: J. Phys. Conf. Ser. – volume: vol. 3 year: 1998 ident: b31 publication-title: The Art of Computer Programming – volume: vol. 639 year: 2016 ident: b13 publication-title: Novel Recursive Fast Sort Algorithm – volume: 20 start-page: 190 year: 1988 end-page: 194 ident: b32 article-title: Textbook errors in binary searching publication-title: ACM SIGCSE Bull. – volume: 1 year: 2013 ident: b18 article-title: A randomized searching algorithm and its performance analysis with binary search and linear search algorithms publication-title: Int. J. Comput. Sci. Appl. (TIJCSA) – volume: 33 start-page: 1756 year: 2012 end-page: 1760 ident: b30 article-title: In search of optimal centroids on data clustering using a binary search algorithm publication-title: Pattern Recognit. Lett. – year: 2012 ident: b41 article-title: Introduction to the Design and Analysis of Algorithms – volume: 90 start-page: 149 year: 2014 end-page: 152 ident: b15 article-title: Long-range dependencies in quick-sort algorithm publication-title: Prz. Elektrotech. – volume: 46 start-page: 346 year: 2015 end-page: 361 ident: b8 article-title: Refined Quicksort asymptotics publication-title: Random Structures Algorithms – volume: 87 start-page: 67 year: 2003 end-page: 71 ident: b33 article-title: On computing the semi-sum of two integers publication-title: Inf. Process. Lett. – year: 2013 ident: b37 article-title: Problem Solving with Algorithms and Data Structures – year: 2003 ident: b35 article-title: Data Structures and Algorithms – year: 2016 ident: b42 article-title: The C++ resources. C/C++ reference – volume: 46 start-page: 677 year: 2015 end-page: 687 ident: b4 article-title: A note on the quicksort asymptotics publication-title: Random Structures Algorithms – volume: vol. 364 year: 2016 ident: b14 publication-title: Preprocessing Large Data Sets by the Use of Quick Sort Algorithm – volume: 11 start-page: 22 year: 2015 ident: b9 article-title: Average case and distributional analysis of dual-pivot quicksort publication-title: ACM Trans. Algorithms – reference: . – volume: 397 start-page: 391 year: 2006 end-page: 397 ident: b27 article-title: Insertion sort is O(n log n) publication-title: Theory Comput. Syst. – year: 2013 ident: b28 article-title: An Introduction to the Analysis of Algorithms – volume: 75 start-page: 632 year: 2016 end-page: 683 ident: b7 article-title: Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy’s partitioning scheme publication-title: Algorithmica – volume: 65 year: 2013 ident: b23 article-title: Quadratic search: a new and fast searching algorithm (an extension of classical binary search strategy) publication-title: Int. J. Comput. Appl. – volume: vol. 7895 year: 2013 ident: b12 publication-title: Modified Merge Sort Algorithm for Large Scale Data Sets – year: 2017 ident: b29 article-title: An efficient dynamic ride-sharing algorithm publication-title: Computer and Information Technology (CIT), 2017 IEEE International Conference on – year: 2011 ident: b38 article-title: Problem Solving with Algorithms and Data Structures Using Python – volume: 72 start-page: 155 year: 2006 end-page: 165 ident: b5 article-title: Dynamic behavior of simple insertion sort algorithm publication-title: Fund. Inform. – year: 2000 ident: b34 article-title: Programming Pearls – year: 2008 ident: b39 article-title: The Algorithm Design Manual – volume: vol. 465 year: 2014 ident: b17 publication-title: An Idea to Apply Firefly Algorithm in 2D Image Key-Points Search – year: 2017 ident: b26 article-title: Efficient hybrid search algorithm on ordered datasets – volume: 33 start-page: 1756 issue: 13 year: 2012 ident: 10.1016/j.future.2019.01.043_b30 article-title: In search of optimal centroids on data clustering using a binary search algorithm publication-title: Pattern Recognit. Lett. doi: 10.1016/j.patrec.2012.06.008 – year: 2017 ident: 10.1016/j.future.2019.01.043_b26 – volume: 75 start-page: 632 issue: 4 year: 2016 ident: 10.1016/j.future.2019.01.043_b7 article-title: Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy’s partitioning scheme publication-title: Algorithmica doi: 10.1007/s00453-015-0041-7 – start-page: 1 year: 2014 ident: 10.1016/j.future.2019.01.043_b16 article-title: Implified firefly algorithm for 2d image key-points search – volume: 930 issue: 1 year: 2017 ident: 10.1016/j.future.2019.01.043_b22 article-title: Comparison searching process of linear, binary and interpolation algorithm publication-title: J. Phys. Conf. Ser. – volume: 46 start-page: 677 issue: 4 year: 2015 ident: 10.1016/j.future.2019.01.043_b4 article-title: A note on the quicksort asymptotics publication-title: Random Structures Algorithms doi: 10.1002/rsa.20524 – volume: 397 start-page: 391 year: 2006 ident: 10.1016/j.future.2019.01.043_b27 article-title: Insertion sort is O(n log n) publication-title: Theory Comput. Syst. doi: 10.1007/s00224-005-1237-z – year: 2013 ident: 10.1016/j.future.2019.01.043_b37 – year: 2012 ident: 10.1016/j.future.2019.01.043_b41 – volume: 46 start-page: 346 issue: 2 year: 2015 ident: 10.1016/j.future.2019.01.043_b8 article-title: Refined Quicksort asymptotics publication-title: Random Structures Algorithms doi: 10.1002/rsa.20497 – volume: 321 start-page: 41 issue: 1 year: 2004 ident: 10.1016/j.future.2019.01.043_b24 article-title: Searching in random partially ordered sets publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2003.06.001 – year: 2016 ident: 10.1016/j.future.2019.01.043_b42 – year: 2013 ident: 10.1016/j.future.2019.01.043_b28 – year: 2017 ident: 10.1016/j.future.2019.01.043_b40 – volume: vol. 465 year: 2014 ident: 10.1016/j.future.2019.01.043_b17 – volume: 65 issue: 14 year: 2013 ident: 10.1016/j.future.2019.01.043_b23 article-title: Quadratic search: a new and fast searching algorithm (an extension of classical binary search strategy) publication-title: Int. J. Comput. Appl. – volume: 159 start-page: 1398 issue: 14 year: 2011 ident: 10.1016/j.future.2019.01.043_b6 article-title: Recursive merge sort with erroneous comparisons publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2011.05.010 – volume: 11 start-page: 22 issue: 3 year: 2015 ident: 10.1016/j.future.2019.01.043_b9 article-title: Average case and distributional analysis of dual-pivot quicksort publication-title: ACM Trans. Algorithms doi: 10.1145/2629340 – ident: 10.1016/j.future.2019.01.043_b36 – year: 2011 ident: 10.1016/j.future.2019.01.043_b38 – volume: 9 start-page: 176 issue: 9 year: 2017 ident: 10.1016/j.future.2019.01.043_b11 article-title: Parallelization of modified merge sort algorithm publication-title: Symmetry doi: 10.3390/sym9090176 – year: 2014 ident: 10.1016/j.future.2019.01.043_b21 – volume: 20 start-page: 190 issue: 1 year: 1988 ident: 10.1016/j.future.2019.01.043_b32 article-title: Textbook errors in binary searching publication-title: ACM SIGCSE Bull. doi: 10.1145/52965.53012 – volume: vol. 364 year: 2016 ident: 10.1016/j.future.2019.01.043_b14 – volume: 71 start-page: 102 year: 2017 ident: 10.1016/j.future.2019.01.043_b1 article-title: Bidirectional conditional insertion sort algorithm; an efficient progress on the classical insertion sort publication-title: Future Gener. Comput. Syst. doi: 10.1016/j.future.2017.01.034 – year: 2017 ident: 10.1016/j.future.2019.01.043_b29 article-title: An efficient dynamic ride-sharing algorithm – volume: vol. 3 year: 1998 ident: 10.1016/j.future.2019.01.043_b31 – year: 2003 ident: 10.1016/j.future.2019.01.043_b35 – volume: 1 issue: 11 year: 2013 ident: 10.1016/j.future.2019.01.043_b18 article-title: A randomized searching algorithm and its performance analysis with binary search and linear search algorithms publication-title: Int. J. Comput. Sci. Appl. (TIJCSA) – volume: 90 start-page: 149 issue: 1 year: 2014 ident: 10.1016/j.future.2019.01.043_b15 article-title: Long-range dependencies in quick-sort algorithm publication-title: Prz. Elektrotech. – volume: 72 start-page: 155 issue: 1–3 year: 2006 ident: 10.1016/j.future.2019.01.043_b5 article-title: Dynamic behavior of simple insertion sort algorithm publication-title: Fund. Inform. – volume: 86 start-page: 266 year: 2018 ident: 10.1016/j.future.2019.01.043_b10 article-title: Brownian motus and clustered binary insertion sort methods: an efficient progress over traditional methods publication-title: Future Gener. Comput. Syst. doi: 10.1016/j.future.2018.04.038 – volume: 87 start-page: 67 issue: 2 year: 2003 ident: 10.1016/j.future.2019.01.043_b33 article-title: On computing the semi-sum of two integers publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(03)00263-1 – year: 2008 ident: 10.1016/j.future.2019.01.043_b39 – volume: 114 start-page: 137 issue: 3 year: 2014 ident: 10.1016/j.future.2019.01.043_b3 article-title: An intuitive and simple bounding argument for Quicksort publication-title: Inform. Process. Lett. doi: 10.1016/j.ipl.2013.10.010 – volume: vol. 639 year: 2016 ident: 10.1016/j.future.2019.01.043_b13 – volume: 32 start-page: 641 issue: 4 year: 2002 ident: 10.1016/j.future.2019.01.043_b19 article-title: Delayed binary search, or playing twenty questions with a procrastinator publication-title: Algorithmica doi: 10.1007/s00453-001-0097-4 – volume: 19 start-page: 543 issue: 10 year: 2012 ident: 10.1016/j.future.2019.01.043_b2 article-title: Enhancing QuickSort algorithm using a dynamic pivot selection technique publication-title: Wulfenia – volume: 52 start-page: 309 issue: 3 year: 2008 ident: 10.1016/j.future.2019.01.043_b20 article-title: Sorting and searching in faulty memories publication-title: Algorithmica doi: 10.1007/s00453-007-9088-4 – volume: 30 start-page: 128 year: 2015 ident: 10.1016/j.future.2019.01.043_b25 article-title: Adaptive search over sorted sets publication-title: J. Discrete Algorithms doi: 10.1016/j.jda.2014.12.007 – volume: vol. 7895 year: 2013 ident: 10.1016/j.future.2019.01.043_b12 – year: 2000 ident: 10.1016/j.future.2019.01.043_b34 |
| SSID | ssj0001731 |
| Score | 2.2706432 |
| Snippet | In this paper, we consider the searching problem over ordered sequences. It is well known that Binary Search (BS) algorithm solves this problem with very... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 743 |
| SubjectTerms | Average-case complexity Binary search Searching algorithm Ternary search |
| Title | New and improved search algorithms and precise analysis of their average-case complexity |
| URI | https://dx.doi.org/10.1016/j.future.2019.01.043 |
| Volume | 95 |
| WOSCitedRecordID | wos000465509600060&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7115 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001731 issn: 0167-739X databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FlAMX3qjlpT3QU-UKP9a7c4yqRICg4lBQbpYfuzhValepifI3-MfMvmxDUaEHLivLiddx5vPst7Oz3xDyBtIoTxOQAWdlEujatgFIyfDFgxhfLRlVViTpIz89FcslfJ5Mfvi9MNs1bxqx28HlfzU1nkNj662ztzB33ymewGM0OrZodmz_yfA6Y9GsCJhwAfJJF9jI19_azaqrL668OIAuqIHHgyqJXTXI8ZHRywRlblLZtXzwbtX9svy7MEokuvyydAgqXXUIJw09MPUL9GZHM922W23PwxN2CPO8XvWo_NTWOnxuA9xVox1OXg9Jw3opX3AcHQuTeLDA-9VHX4_H4Qq9Q8qnVfkIJnpmHpv6ub0LBjbyodzqNrnhmFst4Wue3gYdzo-t9IrO0QOjv-ovHgtr_zbg9WmIPsPtPLO9ZLqX7G2YYS93yF7EGYgp2Zu9ny8_9MN7yF2RS_ccfj-mSRq8_mv-zHdGHObsIbnvJh90ZkHziExk85g88IU9qPPzT8gSMUQRJNRjiFoM0QFD5mOHIeoxRFtFDYboGEN0wNBT8mUxPzt5F7gSHEGJc8kuAIgk42WRK80jIS6FzAukqLFQKQuFAlYhwU5lmETIZRVjhZKAlDmtVFEkRRQ_I9OmbeQ-oVElIVFciy8UiahEroTA6XSYqJBxDnBAYv9HZaXTp9dlUtbZTWY6IEF_1aXVZ_nL97m3QeY4puWOGQLrxiuf3_JOL8i9Af8vybTbfJevyN1y262uNq8dqn4CL1GhIQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=New+and+improved+search+algorithms+and+precise+analysis+of+their+average-case+complexity&rft.jtitle=Future+generation+computer+systems&rft.au=Emrah+Amrahov%2C+%C5%9Eahin&rft.au=Mohammed%2C+Adnan+Saher&rft.au=%C3%87elebi%2C+Fatih+V.&rft.date=2019-06-01&rft.issn=0167-739X&rft.volume=95&rft.spage=743&rft.epage=753&rft_id=info:doi/10.1016%2Fj.future.2019.01.043&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_future_2019_01_043 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-739X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-739X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-739X&client=summon |