-license:gpl heapsort - Pesquisa de Código do Google

Experimente também:

-license:gpl heapsort lang:c	-license:gpl heapsort lang:fortran	-license:gpl heapsort lang:pascal
-license:gpl heapsort lang:c++	-license:gpl heapsort lang:java

irrlicht-0.12.0/include/heapsort.h - 41 idênticos

     5: #ifndef __IRR_HEAPSORT_H_INCLUDED__     6: #define __IRR_HEAPSORT_H_INCLUDED__

    39: //! Sorts an array with size 'size' using heapsort.    40: template<class T>    41: inline void heapsort(T* array_, s32 size)    42: {

ftp2.at.freebsd.org/pub/FreeBSD/distfiles/irrlicht-0.12.0.zip - Desconhecido - C++ - Mais em irrlicht-0.12.0.zip »

src/system/libroot/posix/stdlib/heapsort.c - 2 idênticos

    37: #if defined(LIBC_SCCS) && !defined(lint)    38: static char sccsid[] = "@(#)heapsort.c  8.1 (Berkeley) 6/4/93";    39: #endif /* LIBC_SCCS and not lint */

   139: int   140: heapsort(void *vbase, size_t nmemb, size_t size, int (*compar)(void const *, void const *))   141: {

svn.berlios.de/haiku/haiku/trunk - BSD - C

Sort/HeapSort.lhs - 3 idênticos

     7: > module HeapSort (module HeapSort)     8: > where

    53: > heapSort                      :: (Ord a) => [a] -> [a]    54: > heapSort                      =  heapSortBy (<=)    55: >    56: > heapSortBy                    :: Rel a -> [a] -> [a]

www.ninebynine.org/Software/Swish-0.2.0.zip - Desconhecido - Haskell - Mais em Swish-0.2.0.zip »

unitwalk3/heapsort.c

    14: /*    15:  |  void  heapsort (array, len)    16:  |  KEY_T  array[];

    30: void  heapsort (KEY_T array[], int len)    31: {

logic.pdmi.ras.ru/~arist/UnitWalk/unitwalk3.tar.gz - Desconhecido - C - Mais em unitwalk3.tar.gz »

d/heapsort.d

    18: void    19: heapsort(int n, double *ra) {    20:     int i, j;

    61:     heapsort(N, ary);    62:

www.functionalfuture.com/d/heapsort.d - Desconhecido - D

perftests/heapsort.py

     1: # $Id: heapsort.py,v 1.2 2002/09/24 00:44:38 dhakim Exp $     2: # http://www.bagley.org/~doug/shootout/

    16: def heapsort(n, ra):    17:     rra = i = j = 0

    54:     heapsort(N, ary)    55:

www.projectmoto.org/perftests.tar.gz - Desconhecido - Python - Mais em perftests.tar.gz »

bench/shootout/heapsort.ruby - 12 idênticos

    17: def heapsort(n, ra)    18:     j = i = rra = 0

    53: heapsort(N, ary)    54:

github.com/vvs/jruby.git - EPL - Ruby

include/heapsort.h - 15 idênticos

     1: /*     2:  * heapsort.h -- $Id$     3:  * heapsort interface     4:  */

    11: /* heapsort double, long, or string values    12:  * n is the number of elements, s is the stride

ftp.openbsd.org/pub/OpenBSD/3.9/packages/mips64/yorick-1.5.08p1.tgz - Desconhecido - C

include/heapsort.h

     1: /*     2:    Dit is de header voor het HeapSort algorithme     3:    De code is afkomstig van:

     9: void HeapSort(unsigned long Arr[], unsigned long len)    10: {

home.hccnet.nl/th.v.d.gronde/dev/misc/sorting.zip - Desconhecido - C - Mais em sorting.zip »

Alpha18/Utils/heapsort.ml

     1: (* Heaps and heapsort.     2:    Copyright (C) 1992-1995 Jean Goubault and Bull S.A.

    74:   (* sort a set of elements in ascending order, return list: *)    75:   fun heapsort (op less) =    76:       let val greater = fn (x,y) => y less x

www.lsv.ens-cachan.fr/~goubault/alpha18.tbz - Desconhecido - OCaml - Mais em alpha18.tbz »

Página inicial do Google - Google Code - Debater - Termos de serviço - Ajuda - Envie o seu código

©2009 Google - Privacidade