Code
Results 1 - 10 of about 31,200. (0.54 seconds)
Also try:
 -license:gpl quicksort lang:c -license:gpl quicksort lang:c++ -license:gpl quicksort lang:java
    36: /*
        ** $Header: /sources/cvsroot/Mesa/src/glu/sgi/libnurbs/nurbtess/quicksort.cc,v 1.1.1.1 2005/07/06 09:25:39 gully Exp $
        */
    62:  * quicksort( (void**)v, left, right, (int (*)(void *, void *))comp)
         */
        void quicksort(void *v[], int left, int right,
   116: template<class T, class CMPR>
        void quicksort(T *data, size_t n, CMPR &cmp, size_t min_len = 20)  {
        
   126:   quicksort(data, pivot + 1, cmp, min_len);
          quicksort(data + pivot + 1, n - pivot - 1, cmp, min_len);
    47:    */
          static void QuickSort(int a[], int lo0, int hi0) throws Exception
            {
    89:           if( lo0 < hi )
                    QuickSort( a, lo0, hi );
        
    41:     i, len : byte;
          procedure quicksort(links, rechts: integer);
          var i, j, x, tmp: integer;
    60:   if links < j  then quicksort(links, j);
          if i < rechts then quicksort(i, rechts);
     1: public class Quicksort {
          /*@ requires a != null;
    16:   */
          private static void quicksort(int[] a, int start, int stop, int ulimit, int llimit)
          {
     4: # examples/output/algorithms/quicksort if you rename/move this file.
        
        multi quicksort ( ) { () }
        
        multi quicksort ( *$x, *@xs ) {
    14: say quicksort(1, 5, 2, 4, 3);
    48:   private JLabel[] code={
                    new JLabel("       1.   public class QuickSort         "),
                    new JLabel("       2.       implements Sort        "),
    53:   new JLabel("       5.       public QuickSort(Comparator c)   "),
          new JLabel("       6.       {comp=c;}        "),
          new JLabel("       7.       public QuickSort() {}     "),
    31: /** @file parallel/quicksort.h
         *  @brief Implementation of a unbalanced parallel quicksort (in-place).
         *  This file is a GNU parallel extension to the Standard C++ Library.
    45: {
          /** @brief Unbalanced quicksort divide step.
           *  @param begin Begin iterator of subsequence.
bonkenc.cvs.sourceforge.net/cvsroot/bonkenc - Unknown - C++ - More from bonkenc »


Google Home - Google Code - Discuss - Terms of Service - Help - Submit Your Code

©2009 Google - Privacy