Sorting and Sequential Structures
ثبت نشده
چکیده
This algorithm is appropriately named linear search and has worst-case O(N) time complexity where N is the length of the input array corresponding to checking every element in the array. While linear search takes advantage of the sequential nature of an array (and in general, any sequential data structure), it does not take full advantage of this property. In particular, if the array is ordered, then we can employ binary search to avoid searching every element of the array.
منابع مشابه
Using parallelism techniques to improve sequential and multi-core sorting performance
We propose new sequential sorting operations by adapting techniques and methods used for designing parallel sorting algorithms. Although the norm is to parallelize a sequential algorithm to improve performance, we adapt a contrarian approach: we employ parallel computing techniques to speed up sequential sorting. Our methods can also work for multi-core sorting with minor adjustments that do no...
متن کاملProgramming Research Group COMMUNICATION EFFICIENT DATA STRUCTURES ON THE BSP MODEL WITH APPLICATIONS
The implementation of data structures on distributed memory models such as the Bulk-Synchronous Parallel (BSP) model, rather than shared memory ones such as the PRAM, ooers a serious challenge. In this work we undertake the architecture independent study of the communication and synchronization requirements of searching ordered h-level graphs, which include most of the standard data structures....
متن کاملRecognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log n) time with O(m + n) processors on the CREW PRAM, where m and n are the number of edges and vertices in the graph. The algorithm uses sorting to compute a weak linear ordering of the vertices, from which an interval representation is easily obtained. It is simple, uses no complex data structures, ...
متن کاملParallel computing techniques for sequential and multi-core sorting
We adapt techniques employed in the design of parallel sorting algorithms to propose new sequential and multi-core sorting operations. The proposed approach is used to develop asymptotically efficient deterministic and randomized sorting operations whose practical sequential and multi-core performance, as witnessed by an experimental study, matches or surpasses existing optimized sorting algori...
متن کاملSEQUENTIAL PENALTY HANDLING TECHNIQUES FOR SIZING DESIGN OF PIN-JOINTED STRUCTURES BY OBSERVER-TEACHER-LEARNER-BASED OPTIMIZATION
Despite comprehensive literature works on developing fitness-based optimization algorithms, their performance is yet challenged by constraint handling in various engineering tasks. The present study, concerns the widely-used external penalty technique for sizing design of pin-jointed structures. Observer-teacher-learner-based optimization is employed here since previously addressed by a number ...
متن کامل