示例#1
0
void SortBattler::sortsTimeBattle(int testLength)
{
    SortInterface* hSorter = new HeapSorter;
    SortInterface* qSorter = new QuickSorter;
    SortInterface* sSorter = new ShellSorter;
    SortInterface* iSorter = new InsertSorter;
    SortInterface* bSorter = new BubbleSorter;
    int* battleArray = new int[testLength];

    printf("Integer Array of %d elements will be now sorted\n", testLength);
    printf("Heap:\n");
    printTime();
    hSorter->sortArray(battleArray, testLength);
    printTime();
    printf("---\n");

    fillArrayRandomly(battleArray, testLength);

    printf("Quick:\n");
    printTime();
    qSorter->sortArray(battleArray, testLength);
    printTime();
    printf("---\n");

    fillArrayRandomly(battleArray, testLength);

    printf("Shell:\n");
    printTime();
    sSorter->sortArray(battleArray, testLength);
    printTime();
    printf("---\n");

    fillArrayRandomly(battleArray, testLength);

    printf("Insert:\n");
    printTime();
    iSorter->sortArray(battleArray, testLength);
    printTime();
    printf("---\n");

    fillArrayRandomly(battleArray, testLength);

    printf("Bubble:\n");
    printTime();
    bSorter->sortArray(battleArray, testLength);
    printTime();
    printf("---\n");

    delete hSorter;
    delete qSorter;
    delete iSorter;
    delete sSorter;
    delete bSorter;
}
示例#2
0
文件: ex3.c 项目: kelvinlouis/fhnw
void main() 
{
  int arr[5];
  int len = sizeof(arr)/sizeof(arr[0]);

  fillArrayRandomly(arr, len, 1, 100);

  if (DEBUG)
    printArr(arr, len);

  insertionSort(arr, len);

  if (DEBUG)
    printArr(arr, len);

  reverseArr(arr, len);

  if (DEBUG)
    printArr(arr, len);

  moveArr(arr, len, 3);

  if (DEBUG)
    printArr(arr, len);
}