Lines Matching +full:partition +full:- +full:art

110 function is a modified partition-exchange sort, or quicksort.
117 intended for sorting data with pre-existing order.
200 a variant of partition-exchange sorting; in particular, see
206 O N**2 worst-case behavior.
218 takes O N lg N worst-case time.
236 is optimized for data with pre-existing order; its worst case
245 Memory availability and pre-existing order in the data can make this
266 is zero, then the runtime-constraint handler is called, and
281 function returns zero on success, non-zero on error.
283 .Rv -std heapsort mergesort
290 .Bd -literal
304 	return ((left > right) - (left < right));
338 .St -p1003.1-2024 .
347 .St -isoC-2011
348 and may not be portable to other standards-conforming platforms.
361 .Bl -tag -width Er
389 .%P pp. 10-15
397 .%P pp. 347-348
402 .%B "The Art of Computer Programming"
405 .%P pp. 114-123, 145-149
410 .%J "Fourth Annual ACM-SIAM Symposium on Discrete Algorithms"
417 .%J "Software--Practice and Experience"
419 .%P pp. 1249-1265
426 .St -isoC .
430 .St -p1003.1-2024 .
434 .St -isoC-2011
446 .St -p1003.1-2024 .