Find link

language:

Find link is a tool written by Edward Betts.

searching for Qsort 11 found (26 total)

alternate case: qsort

Erlang (programming language) (4,824 words) [view diff] exact match in snippet view article

comprehension: %% qsort:qsort(List) %% Sort a list of items -module(qsort). % This is the file 'qsort.erl' -export([qsort/1]). % A function 'qsort' with 1 parameter

Total functional programming (721 words) [view diff] exact match in snippet view article find links to article

List (partition) qsort [] = [] qsort [a] = [a] qsort (a:as) = let (lesser, greater) = partition (<a) as in qsort lesser ++ [a] ++ qsort greater To make

OCaml (3,909 words) [view diff] exact match in snippet view article find links to article

let rec qsort = function | [] -> [] | pivot :: rest -> let is_less x = x < pivot in let left, right = List.partition is_less rest in qsort left @ [pivot]

Scala (programming language) (9,871 words) [view diff] exact match in snippet view article

The line above as written: qsort(smaller) ::: pivot :: qsort(rest) could also be written thus: qsort(rest).::(pivot).:::(qsort(smaller)) in more standard

Lucid (programming language) (723 words) [view diff] exact match in snippet view article

current n; divs = N mod prime eq 0; end; end qsort(a) = if eof(first a) then a else follow(qsort(b0),qsort(b1)) fi where p = first a < a; b0 = a whenever

Function object (4,372 words) [view diff] exact match in snippet view article find links to article

void* b) { return ( *(int *)a - *(int *)b ); } ... // prototype of qsort is // void qsort(void *base, size_t nel, size_t width, int (*compar)(const void *

Joy (programming language) (721 words) [view diff] exact match in snippet view article

makes Joy concise, as illustrated by this definition of quicksort: DEFINE qsort == [small] [] [uncons [>] split] [enconcat] binrec. "binrec" is one of Joy's

Python syntax and semantics (6,790 words) [view diff] exact match in snippet view article find links to article

comprehensions: def qsort(L): if L == []: return [] pivot = L[0] return (qsort([x for x in L[1:] if x < pivot]) + [pivot] + qsort([x for x in L[1:] if

Dudley J. LeBlanc (450 words) [view diff] exact match in snippet view article find links to article

Long to Hadacol http://www.alibris.com/search/search.cfm?S=R&qwork=1336975&qsort=p&siteID=KLVmR9fE2yU-LcsUdqTmR6Odz.nkB9F.IA http://www.acadian.org/leblanc

C++ (9,550 words) [view diff] exact match in snippet view article find links to article

sort) that perform even better than, for example, the C standard library qsort, thanks to C++ features like using inlining and compile-time binding instead

Research Domain Criteria (1,758 words) [view diff] case mismatch in snippet view article find links to article

Multidimensional Scale of Perceived Social Support Parental Bonding Instrument QSORT Parent Attachment interview Social Anhedonia scale Social subscales of depression