5: #ifndef __IRR_HEAPSORT_H_INCLUDED__
        #define __IRR_HEAPSORT_H_INCLUDED__

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

    22: void
        heapsort(int n, double *ra) {
            int i, j;

    67:     heapsort(N, ary);
        

    10: var elapsed=new Date()-start;
        print("metric jsbench-heapsort "+elapsed);
        

   109:   * array # being sorted 2. Offsets within which to sort This performs the
          * core sort of the Heapsort algorithm
          */

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

    53: heapsort(N, ary)
        

     1: /*-------------------Start heapsort.c program-------------------*/
        

    31: /* (1) UNIX Systems:                                */
        /*     cc -DUNIX -O heapsort.c -o heapsort          */
        /*     cc -DUNIX heapsort.c -o heapsort             */
        /****************************************************/

     1: // -*- mode: c++ -*-
        // $Id: heapsort.cpp,v 1.4 2007/05/03 16:55:46 laurov Exp $
        // http://www.bagley.org/~doug/shootout/

    21: void
        heapsort(int n, double *ra) {
            int i, j;

     1: c-----------------------------------------------------------------------
              subroutine heapsort(vref,n,v1,v2,v3)
        c-----------------------------------------------------------------------

     7: > module HeapSort (module HeapSort)
        > where

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

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

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

     1: /** Implementaton of the heapsort algorithm.
         *  @author Koffman and Wolfgang

     5: public class HeapSort {
          /** Sort the array using heap sort algorithm.