Abstract: Parallel search is a way to increase search speed by using additional processors. Researchers propose a parallel search algorithm that searches an item in unordered array, the searching time obtained is better than that obtained in binary search. That is justified by the fact that the binary search requires a variant time for sorting the input array. The speed up of the proposed algorithm is increased linearly with the input size by saving the time spent in sorting input data. In the proposed algorithm, the array to be searched is divided into two subarrays and then, two search threads are created in parallel which required O (n/2) in the worst case (where all the items is scanned), reducing the searching time in the worst case to O (n/2+log n). Log n is the time needed to splitting an array of size n. The efficiency is increased quickly for an input size of 5000-1,000,000 item. However, the efficiency suffers a little variation for an input size of 1,000,000-5,000,000 item that is because the binary search has an optimal running time for large sorted input size where the searching space is reduced by a factor of 2 each time.
Ahmad Haboush and Sami Qawasmeh, 2011. Parallel Sequential Searching Algorithm for Unsorted Array. Research Journal of Applied Sciences, 6: 70-75.