双向a*搜索算法_双向搜索算法

双向a*搜索算法

什么是双音搜索？ (What is bitonic search?)

Searching a bitonic array is known as bitonic search. An array is said to be bitonic if it has an increasing sequence of integers followed immediately by a decreasing sequence of integers.

搜索双音阵列称为双音搜索 。 如果数组具有递增的整数序列，紧随其后的是递减的整数序列，则称其为双偶数 。

Given a bitonic array our work is to search a given input element in the bitonic array. In case of minimum time complexity we can think of linear search in O(n) time but bitonic search takes only O(logn) steps to complete the searching.

给定一个双调阵列我们的工作是双调数组中搜索给定的输入元素。 在最小时间复杂度的情况下，我们可以考虑在O(n)时间内进行线性搜索，但双音位搜索仅需O(logn)</