对在长期的算法研究中提出的PAR方法和PAR平台引入时间谓词加以扩展,不仅可以形式化推导出顺序查找和二分查找问题的算法程序,而且这两个问题关于时间复杂度的递归方程式也可同步且自然地推导得到。这为开发并验证高效率的算法开辟了一条新途径。
This paper extend the partition-and-recur(PAR) approach which presented in the long-term research of algorithms through importing time prediction. Then the PAR approach could formally deduce not only sequential search and binary search problem' s algorithms, but also their recursion equations about time complexity simultaneously and naturally. It pioneers a new avenue to develop and verify high efficiency algorithms.