https://dunwu.github.io/assets/index.html-4a8df5a3.js

1const e=JSON.parse('{"key":"v-24e720d3","path":"/pages/b14afb/","title":"线性表的查找","lang":"zh-CN","frontmatter":{"title":"线性表的查找","date":"2015-03-10T18:29:13.000Z","order":11,"permalink":"/pages/b14afb/","category":["数据结构和算法","线性表"],"tag":["数据结构","线性表","查找"],"description":"线性表的查找 查找简介 什么是查找？ 查找是根据给定的某个值，在表中确定一个关键字的值等于给定值的记录或数据元素。 查找算法的分类 若在查找的同时对表记录做修改操作（如插入和删除），则相应的表称之为动态查找表； 否则，称之为静态查找表。 此外，如果查找的全过程都在内存中进行，称之为内查找； 反之，如果查找过程中需要访问外存，称之为外查找。","head":[["meta",{"property":"og:url","content":"https://dunwu.github.io/pages/b14afb/"}],["meta",{"property":"og:site_name","content":"钝悟"}],["meta",{"property":"og:title","content":"线性表的查找"}],["meta",{"property":"og:description","content":"线性表的查找 查找简介 什么是查找？ 查找是根据给定的某个值，在表中确定一个关键字的值等于给定值的记录或数据元素。 查找算法的分类 若在查找的同时对表记录做修改操作（如插入和删除），则相应的表称之为动态查找表； 否则，称之为静态查找表。 此外，如果查找的全过程都在内存中进行，称之为内查找； 反之，如果查找过程中需要访问外存，称之为外查找。"}],["meta",{"property":"og:type","content":"article"}],["meta",{"property":"og:locale","content":"zh-CN"}],["meta",{"property":"og:updated_time","content":"2024-05-15T22:46:25.000Z"}],["meta",{"property":"article:author","content":"钝悟"}],["meta",{"property":"article:tag","content":"数据结构"}],["meta",{"property":"article:tag","content":"线性表"}],["meta",{"property":"article:tag","content":"查找"}],["meta",{"property":"article:published_time","content":"2015-03-10T18:29:13.000Z"}],["meta",{"property":"article:modified_time","content":"2024-05-15T22:46:25.000Z"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"Article\\",\\"headline\\":\\"线性表的查找\\",\\"image\\":[\\"\\"],\\"datePublished\\":\\"2015-03-10T18:29:13.000Z\\",\\"dateModified\\":\\"2024-05-15T22:46:25.000Z\\",\\"author\\":[{\\"@type\\":\\"Person\\",\\"name\\":\\"钝悟\\",\\"url\\":\\"https://dunwu.github.io\\"}]}"]]},"headers":[{"level":2,"title":"查找简介","slug":"查找简介","link":"#查找简介","children":[{"level":3,"title":"什么是查找？","slug":"什么是查找","link":"#什么是查找","children":[]},{"level":3,"title":"查找算法的分类","slug":"查找算法的分类","link":"#查找算法的分类","children":[]},{"level":3,"title":"查找算法性能比较的标准","slug":"查找算法性能比较的标准","link":"#查找算法性能比较的标准","children":[]}]},{"level":2,"title":"顺序查找","slug":"顺序查找","link":"#顺序查找","children":[]},{"level":2,"title":"二分查找","slug":"二分查找","link":"#二分查找","children":[]},{"level":2,"title":"分块查找","slug":"分块查找","link":"#分块查找","children":[]},{"level":2,"title":"三种线性查找的 PK","slug":"三种线性查找的-pk","link":"#三种线性查找的-pk","children":[]},{"level":2,"title":"参考资料","slug":"参考资料","link":"#参考资料","children":[]}],"git":{"createdTime":1694447058000,"updatedTime":1715813185000,"contributors":[{"name":"dunwu","email":"[email protected]","commits":2}]},"readingTime":{"minutes":7.8,"words":2340},"filePathRelative":"11.数据结构和算法/01.线性表/11.线性表的查找.md","localizedDate":"2015å¹´3月10日","excerpt":"<h1> 线性表的查找</h1>\\n<h2> 查找简介</h2>\\n<h3> 什么是查找？</h3>\\n<p><strong>查找</strong>是根据给定的某个值，在表中确定一个关键字的值等于给定值的记录或数据元素。</p>\\n<h3> 查找算法的分类</h3>\\n<p>若在查找的同时对表记录做修改操作（如插入和删除），则相应的表称之为<strong>动态查找表</strong>；</p>\\n<p>否则，称之为<strong>静态查找表</strong>。</p>\\n<p>此外，如果查找的全过程都在内存中进行，称之为<strong>内查找</strong>；</p>\\n<p>反之，如果查找过程中需要访问外存，称之为<strong>外查找</strong>。</p>","autoDesc":true}');export{e as data};