QSORT


Also found in: Encyclopedia.
AcronymDefinition
QSORTQuick Sorting
Copyright 1988-2018 AcronymFinder.com, All rights reserved.
References in periodicals archive ?
Program Description Benchmark suite Bzip2 File compression SPEC benchmarks and decompression program Perlbench SPEC benchmark SPEC benchmarks for perl interpreter Blackscholes Financial analysis PARSEC benchmarks program Swaptions Price portfolio of PARSEC benchmarks swaptions TSP Solving the TSP Stanford benchmarks problem by genetic algorithms Qsort quick-sort algorithm Stanford benchmarks IS Integer sorting, random NAS benchmarks memory access EP Embarrassingly NAS benchmarks Parallel BFS Breadth-First Parboil benchmarks search MM Dense Matrix-Matrix Parboil benchmarks Multiply Table 3.
These programs are qsort (which performs the algorithm of quick sort), isqrt (which is base two analogue of the square root algorithm), cubic (which solves a cubic polynomial), rad2deg (which converts between radians and degrees), crc (which computes 32-bit crc to detect accidental changes to raw data), and bitstrng (which prints bit pattern of bytes formatted to string).
Some representative tasks such as mesa, ammp, quake, bzip, mcf, math, and qsort from MiBench [26] and SPEC CPU2000 [27] are selected as the benchmarks.
Bem and Allen (1974) used Stephenson's (1953) Q-method to develop Qsort template-matching techniques, which help to indicate differences and correlations between two value systems, such as the conceptual fitting situation (Chatman, 1989; O'Reilly, Chatman, & Caldwell, 1991) or value fitting (Staw & Clausen, 1986) of an individual to an organization.
Tendo por referencia os criterios de seguranca e dependencia relativos a uma crianca ideal, definidos por um conjunto de peritos, estes dados foram correlacionados com a informacao recolhida atraves do perfil QSort, para se alcancarem resultados em ambos os construtos.
Also, subroutines REORDR, QSORT, and PERMUT were removed from the package, since it is no longer advantageous to presort the nodes.
In our scenario, Bill is writing a sorting program called Qsort, sorting a number of unsorted elements, based on the Quicksort algorithm, which splits a list around an element into a list of lower numbers and a list of higher numbers that are then recursively sorted.
The programs rev_shrt, deriv, gauss, mtx_add, qsort, and trans were timed using a SPARCserver 670MP with four Cypress, CY605 CPUs and 64MB of RAM.