| 
            Last change
 on this file since b0aa9c was             a0bcf1, checked in by Frederik Heber <heber@…>, 18 years ago           | 
        
        
          | 
             
-initial commit 
-Minimum set of files needed from ESPACK SVN repository 
-Switch to three tantamount package parts instead of all relating to pcp (as at some time Ralf's might find inclusion as well) 
 
           | 
        
        
          
            
              - 
Property                 mode
 set to                 
100644
               
             
           | 
        
        
          | 
            File size:
            918 bytes
           | 
        
      
      
| Line |   | 
|---|
| 1 | #ifndef mergesort2_h
 | 
|---|
| 2 | #define mergesort2_h
 | 
|---|
| 3 | /** \file mergesort2.h
 | 
|---|
| 4 |  * Header file for \ref mergesort2.c
 | 
|---|
| 5 |  * 
 | 
|---|
| 6 |  * Contains declarations of the functions implemented in \ref mergesort2.c
 | 
|---|
| 7 |  * 
 | 
|---|
| 8 |    Project: CP
 | 
|---|
| 9 |    Jan Hamaekers
 | 
|---|
| 10 |    2000
 | 
|---|
| 11 |    
 | 
|---|
| 12 |    $Id: mergesort2.h,v 1.6 2006/03/30 22:19:51 foo Exp $
 | 
|---|
| 13 | 
 | 
|---|
| 14 |    File: mergesort2.h 
 | 
|---|
| 15 |    Usage:
 | 
|---|
| 16 |    Insert in your Code
 | 
|---|
| 17 |    #include"mergesort.h"
 | 
|---|
| 18 |    double GetKey(void *Element, int i, void *Args) { } 
 | 
|---|
| 19 |    void (*CopyElement)(void *, int i, void *, int j) { }
 | 
|---|
| 20 | 
 | 
|---|
| 21 |    Use:
 | 
|---|
| 22 |     naturalmergesort(a, b, l,r,&GetKey,&CopyElement)
 | 
|---|
| 23 |      struct Element* a, *b   # b Puffer Speicher reservieren !!!
 | 
|---|
| 24 |      int l,r
 | 
|---|
| 25 | */
 | 
|---|
| 26 | 
 | 
|---|
| 27 | #include<stdlib.h>
 | 
|---|
| 28 | 
 | 
|---|
| 29 | void naturalmergesort(void *a, void *b, int l, int r, double (*GetKey)(void *, int i, void *), void *Args, void (*CopyElement)(void *, int i, void *, int j));
 | 
|---|
| 30 |   /* sort a[l]...a[r] 
 | 
|---|
| 31 |    !!! Nutzt vorhandenen Teilfolgen aus !!!
 | 
|---|
| 32 |    C_min = O(N)
 | 
|---|
| 33 |    C_max = O(N)
 | 
|---|
| 34 |   */
 | 
|---|
| 35 |   
 | 
|---|
| 36 | #endif
 | 
|---|
       
      
  Note:
 See   
TracBrowser
 for help on using the repository browser.