This paper presents an application of the theory of sorting networks to facilitate the synthesis of optimized general-purpose sorting libraries. Standard sorting libraries are often based on combinations of the classic Quicksort algorithm with insertion sort applied as base case for small, fixed, numbers of inputs. Unrolling the code for the base case by ignoring loop conditions eliminates bran...

We investigated the impacts of three sorting techniques on various cognitive tasks performed on a tabular representation. The tasks under study were a multi-attribute object selection task and selected low-level analytic tasks. Three sorting techniques, including sorting by a column (Typical Sort: TS), sorting by all columns simultaneously (SimulSort: SS), and sorting by all columns with faithf...

In all recent near-optimal sorting algorithms for meshes, the packets are sorted with respect to some snake-like indexing. In this paper we present deterministic algorithms for sorting with respect to the more natural row-major indexing. For 1-1 sorting on an n n mesh, we give an algorithm that runs in 2 n+ o(n) steps, matching the distance bound, with maximal queue size five. It is considerabl...

This paper studies the algorithms for coding and decoding Prufer codes of a labeled tree. The algorithms for coding and decoding Prufer codes of a labeled tree in the literatures require time usually. Although there exist linear time algorithms for Prufer-like codes [1,2,3], the algorithms utilize the integer sorting algorithms. The special range of the integers to be sorted is utilized to obta...

We exhibit intrinsic definitions of inequality tests, sorting functions and comparators as isomorphic presentations of total preorders (orders): • Inequality tests are functions of type T × T → Bool that are reflexive, transitive and total. • Sorting functions are functions of type T ∗ → T ∗ (mapping finite sequences of elements of type T ) that permute their input and do so consistently for ea...

introduction: the aim of this study was to compare in a clinical sample that subjects with obsessive-compulsive disorder and generalized anxiety disorder on certain task of executive functioning. method: the clinical characteristics and neuropsychological performance of adults with ocd (n=22), fulfilling dsm-iv criteria for ocd and control groups including generalized anxiety disorder (gad) and...

We introduce a sorting scheme which is capable of efficiently sorting encrypted data without the secret key. The technique is obtained by focusing on the multiplicative depth of the sorting circuit alongside the more traditional metrics such as number of comparisons and number of iterations. The reduced depth allows much reduced noise growth and thereby makes it possible to select smaller param...