Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,328,277 papers from all fields of science
Search
Sign In
Create Free Account
Qsort
Known as:
Sort
qsort is a C standard library function that implements a polymorphic sorting algorithm for arrays of arbitrary objects according to a user-provided…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
ANSI C
Assembly language
BSD
Function pointer
Expand
Broader (1)
C standard library
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A class of orders with linear? time sorting algorithm
Laurent Lyaudet
arXiv.org
2018
Corpus ID: 52156235
In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm…
Expand
2018
2018
qsort R package: A New Tool for Scoring Q-sort Data
David N. Sousa
,
João R. Daniel
Journal of Open Source Software
2018
Corpus ID: 56486317
The use of Q-sets to describe subjective views on a specific research domain, in a way suitable for quantitative data analysis…
Expand
Review
2017
Review
2017
Toward the Conceptualization of Citizen’s Trust in Jordanian E-Government Systems: A Q-Methodology Approach
Yousef Elsheikh
2017
Corpus ID: 212468105
Summary Trust highlights as an important factor in helping citizens to overcome the perceived risks. Accordingly, the in-depth…
Expand
Review
2016
Review
2016
Democratising bureaucracy: the many meanings of public participation in social policy and how to harness them
Rikki Dean
2016
Corpus ID: 157559470
Calls for greater public participation in the policy process have become a commonplace in contemporary governance, advocated…
Expand
2016
2016
Using parallelism techniques to improve sequential and multi-core sorting performance
A. Gerbessiotis
arXiv.org
2016
Corpus ID: 13198983
We propose new sequential sorting operations by adapting techniques and methods used for designing parallel sorting algorithms…
Expand
2014
2014
Compact Representation and Efficient Manipulation of Sparse Multidimensional Arrays
Timoteus Dahlberg
2014
Corpus ID: 17661984
Efficient manipulation of sparse multidimensional arrays, or tensors, is of interest because their decompositions have…
Expand
2011
2011
Parallel computing techniques for sequential and multi-core sorting
A. Gerbessiotis
2011
Corpus ID: 14627919
We adapt techniques employed in the design of parallel sorting algorithms to propose new sequential and multi-core sorting…
Expand
2000
2000
Attachment and Autonomy in Adolescence 1 Adolescents ’ and Mothers ’ Models of Attachment as Predictors of Developing Autonomy and Relatedness in Observed Family Interactions
A. H. Gitter
,
R. Marvin
2000
Corpus ID: 17084621
This study examined links between adolescent and maternal attachment models and the adolescent developmental task of attaining…
Expand
1997
1997
PiSMA: an upgradable fault tolerant approach to parallel processing
D. Lioupis
,
A. Pipis
,
Michael Stefanidakis
Proceedings Fourth International Conference on…
1997
Corpus ID: 5863988
Parallel processors reduce the communication overhead problem with the employment of some form of global communication network…
Expand
1991
1991
On the Beneets of Diierent Analyses in the Compilation of a Lazy Functional Language
P. Hartel
,
H. Glaser
,
J. Wild
1991
Corpus ID: 15594271
Implementations of lazy functional languages have not as yet approached the speed of execution provided by imperative, or even…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE