二分查找中比较的解析推导

ACM Signum Newsletter Pub Date : 1997-10-01 DOI:10.1145/289251.289255

T. Rolfe

{"title":"二分查找中比较的解析推导","authors":"T. Rolfe","doi":"10.1145/289251.289255","DOIUrl":null,"url":null,"abstract":"Numerous authors of programming texts and algorithms / data structures texts develop code for the binary search. The common implementation is one in which the loop contains two comparisons for three outcomes --- the key is to the left of the midpoint, to the right of the midpoint, or exactly at the midpoint --- Implementation A below.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Analytic derivation of comparisons in binary search\",\"authors\":\"T. Rolfe\",\"doi\":\"10.1145/289251.289255\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Numerous authors of programming texts and algorithms / data structures texts develop code for the binary search. The common implementation is one in which the loop contains two comparisons for three outcomes --- the key is to the left of the midpoint, to the right of the midpoint, or exactly at the midpoint --- Implementation A below.\",\"PeriodicalId\":177516,\"journal\":{\"name\":\"ACM Signum Newsletter\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Signum Newsletter\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/289251.289255\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Signum Newsletter","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/289251.289255","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

许多编程文本和算法/数据结构文本的作者开发了二进制搜索的代码。常见的实现是循环包含对三个结果的两次比较——关键是在中点的左边，中点的右边，或者正好在中点——下面的实现A。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Analytic derivation of comparisons in binary search

Numerous authors of programming texts and algorithms / data structures texts develop code for the binary search. The common implementation is one in which the loop contains two comparisons for three outcomes --- the key is to the left of the midpoint, to the right of the midpoint, or exactly at the midpoint --- Implementation A below.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM Signum Newsletter

自引率

0.00%

发文量