Search  

---

C:/temp/src/j2k/DataType/Sort/Sort.hpp

Go to the documentation of this file.

// Sort.hpp - Implementation of Slow Sort method algorithm such as:
//            Insertion Sort, Bubble Sort, Selection Sort, Shell Sort
//            Radix Sort, Heap Sort, Merge Sort only.

#ifndef __J2K__Sort_HPP__
#define __J2K__Sort_HPP__    // To avoid multiple declaration of a class

#include "Const.hpp"
#include "MaxHeap.hpp"

static long POW2[17] = {   1,    2,     4,     8,    16,   
                                32,    64,   128,   256,  
                               512,  1024,  2048,  4096, 
                              8192, 16384, 32768, 65536  };

#define BITS  6

void InsertionSort(  Elem* array, int n  );
void BubbleSort(     Elem* array, int n  );
void SelectionSort(  Elem* array, int n  );
void ShellSort(      Elem* array, int n  );
void InsertionSort(  Elem* array, int n, int incr );

void MergeSort(Elem* array, int Size);
void HeapSort( Elem* array, int Size );
void RadixSort(Elem* array, long Size);

void QuickSort( Elem* array, int Size );
void BrightQSort(  Elem* array, ulong Size );
void OldQuickSort( Elem* array, ulong Size );

void MergeSort(Elem* array, Elem* temp, int left, int right);

struct QEntry {
   long Left;
   long Right;
};

// Swap longents: A[i] <==> A[j]
inline void swap( Elem* A, int i, int j ) 
{
  Elem temp = A[i];
  A[i] = A[j];
  A[j] = temp;
}

#endif // End of Sort.hpp

---