t_sorts.cpp

Go to the documentation of this file.

/*****************************************************************************\
*                                                                             *
*  Name   : test_sorts                                                        *
*  Author : Chris Koeritz                                                     *
*                                                                             *
*******************************************************************************
* Copyright (c) 1992-$now By Author.  This program is free software; you can  *
* redistribute it and/or modify it under the terms of the GNU General Public  *
* License as published by the Free Software Foundation; either version 2 of   *
* the License or (at your option) any later version.  This is online at:      *
*     http://www.fsf.org/copyleft/gpl.html                                    *
* Please send any updates to: fred@gruntose.com                               *
\*****************************************************************************/

#include <basis/chaos.h>
#include <basis/function.h>
#include <basis/guards.h>
#include <basis/shell_sort.h>
#include <opsystem/application_shell.h>
#include <loggers/console_logger.h>
#include <data_struct/static_memory_gremlin.h>

const int MAX_ELEMENTS = 1200;

const int MAX_VALUE = 28000;

#define LOG(s) CLASS_EMERGENCY_LOG(program_wide_logger(), s)

class test_sorts : public application_shell
{
public:
  test_sorts() : application_shell(class_name()) {}
  IMPLEMENT_CLASS_NAME("test_sorts");
  virtual int execute();
};

int test_sorts::execute()
{
  FUNCDEF("execute");

  int *list = new int[MAX_ELEMENTS];
  for (int i = 0; i < MAX_ELEMENTS; i++)
    list[i] = randomizer().inclusive(0, MAX_VALUE);

//istring ret;
//for (int i = 0; i < MAX_ELEMENTS; i++) ret += isprintf("%d ", list[i]);
//LOG(ret);
//LOG("-------------");

  // check a normal sort.
  shell_sort(list, MAX_ELEMENTS);
  int last = -1;
  for (int j = 0; j < MAX_ELEMENTS; j++) {
    if (list[j] < last)
      deadly_error("t_sorts", "ordering check", "list is not ordered");
    last = list[j];
  }

  // re-randomize the list.
  for (int i = 0; i < MAX_ELEMENTS; i++)
    list[i] = randomizer().inclusive(0, MAX_VALUE);

  // check a reversed sort.
  shell_sort(list, MAX_ELEMENTS, true);
  last = MAX_VALUE + 100;  // past the maximum we'll include in the list.
  for (int j = 0; j < MAX_ELEMENTS; j++) {
    if (list[j] > last)
      deadly_error("t_sorts", "ordering check", "list is not ordered");
    last = list[j];
  }

  // clean up now.
  delete [] list;

  guards::alert_message("shell_sort:: works for those functions tested.");
  return 0;
}

HOOPLE_MAIN(test_sorts, )

---