Quicksort[2, 1, 3] is one of the most efficient and widely used sorting algorithms. The major drawback of quicksort is that worst case time complexity of naive implementations of quicksort is O(n2) with input size n. In order to avoid this worst case behavior, a variant of quicksort, so-called introsort[4] 1 , is often used. There exists another solution to keep the worst case complexity of qui...

The widely known Quicksort algorithm does not attempt to actively take advantage of partial order in sorting data. A relatively simple change can be made to the Quicksort strategy to give a bestcase performance of n. for ordered data. with a smooth transition to O(n log n) for the random data case. An attractive attribute of this new algorithm CTransort> Is that its performance for random data ...

Quicksort is one of the most popular algorithms for sequential computers because of its simplicity, low overhead and optimal average complexity. Quicksort algorithm is an ideal candidate for recursive implementation as it is based upon the recursive decomposition of the input data. In this report, I discuss the various issues involved in parallelizing the Quicksort algorithm on a Message Passin...

In this paper we present GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multi-core graphics processors. Quicksort has previously been considered as an inefficient sorting solution for graphics processors, but we show that GPU-Quicksort often performs better than the fastest known sorting implementations for graphics processors, such as radix and bitonic sort. Quick...

Sorting is a well-known computational problem. Sorting means arranging a set of records (or a list of keys) in some (increasing or decreasing) order. Randomized algorithms often have low complexity and are associated to robustness bounds, which are generally less conservative than the classical ones. This paper presents a noble randomized Quicksort with a random number generator. This randomize...

Sorting algorithms for distributed memory systems are essential for quickly sorting large amounts of data. The de facto standard for communication in High Performance Computing (HPC) is the Message Passing Interface (MPI). MPI uses the concept of communicators to connect groups of PEs. Recursive algorithms may split a group of PEs into subgroups and then execute the algorithm on these subgroups...

In this dissertation we look at different two models of sorting algorithms based on divideand-conquer algorithms. Quicksort algorithm, sort an unsorted array of n distinct elements. Partial Quicksort sorts the l smallest elements in a list of length n. Both stochastic divide-and-conquer algorithms are widely studied. Our algorithm Quicksort on the fly provides online the first smallest, then se...

recently, phiangsungnoen et al. [j. inequal. appl. 2014:201 (2014)] studied fuzzy mappings in the framework of hausdorff fuzzy metric spaces.following this direction of research, we establish the existence of fixed fuzzy points of fuzzy mappings. an example is given to support the result proved herein; we also present a coincidence and common fuzzy point result. finally, as an application of ou...