Sherin W. Hijazi

Work place: University of Jordan, Amman, Jordan



Research Interests: Network Security, Multimedia Information System, Data Structures and Algorithms, Algorithm Design, Analysis of Algorithms, Program Analysis and Transformation


Sherin W. Hijazi, is obtained her Bc in Management Information Systems from An-Najah University in 2005, then she completed her study in the master of Information Technology and Computer Science from Al Yarmouk University in 2012. She has 11 years' experiences in computer information system and programming. She worked in Palestine Technical University, Tulkarem, Palestine as a lecturer, between 2007 until now. Now she is a Ph.D. student in University of Jordan. She interests in network security, data base system, information analysis and design, and parallel algorithm.

Author Articles
Study of Performance Evaluation of Binary Search on Merge Sorted Array Using Different Strategies

By Sherin W. Hijazi Mohammad Qatawneh

DOI:, Pub. Date: 8 Dec. 2017

Search algorithm, is an efficient algorithm, which performs an important task that locates specific data among a collection of data. Often, the difference among search algorithms is the speed, and the key is to use the appropriate algorithm for the data set. Binary search is the best and fastest search algorithm that works on the principle of ‘divide and conquer’. However, it needs the data collection to be in sorted form, to work properly. In this paper, we study the efficiency of binary search, in terms of execution time and speed up, by evaluating the performance improvement of the combined search algorithms, which are sorted into three different strategies: sequential, multithread, and parallel using message passing interface. The experimental code is written in ‘C language’ and applied on an IMAN1 supercomputer system. The experimental results show that the decision variables are generated from the IMAN1 supercomputer system, which is the most efficient. It varied for the three different strategies, which applies binary search algorithm on merge sort. The improvement in performance evaluation gained by using parallel code, greatly depends on the size of data set used, and the number of processors that the speed-up of the parallel codes on 2, 4, 8, 16, 32, 64, 128, and 143 processors is best executed, using between a 50,000 and 500,000 dataset size, respectively. Moreover, on a large number of processors, parallel code achieves the best speed-up to a maximum of 2.72.

[...] Read more.
Other Articles