Performance analysis for static searching algorithms
MA Jing-shan
QIN Yu-ping
Abstract：Searching is often used in information process .The performance of static searching algorithms , which include sequential search and binary search , is analyzed , and the calculation methods of average search length are given .The analysis results provide a reference for software designers .
Keywords：sequential searchbinary searchbinary treeaverage search length
Publication Date：2014-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 23-27 )