Complexity Research on B Algorithm

Abstract:

Article Preview

The time complexity of B algorithm, one of the intelligent search algorithms, is discussed. By anatomizing some instances, it is pointed out that the cost of calculating the value of heuristic function should be included in the range of time complexity analysis for B algorithm. And then, an algorithm of calculating the value of heuristic function is presented. By analyzing the cost of calculating the value of heuristic function, it is pointed out that the number of recursions in B algorithm is O(n!) in the worst case. Therefore, the time complexity of B algorithm is exponential instead of O(n2).

Info:

Periodical:

Edited by:

Qi Luo

Pages:

173-177

DOI:

10.4028/www.scientific.net/AMM.20-23.173

Citation:

A. L. Han "Complexity Research on B Algorithm", Applied Mechanics and Materials, Vols. 20-23, pp. 173-177, 2010

Online since:

January 2010

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.