main.cpp

数据结构与程序设计教材源码 数据结构与程序设计教材源码

 
#include "../../C/UTILITY.H"
#include "../../C/UTILITY.CPP"
#include "../../B/RANDOM.H"
#include "../../B/RANDOM.CPP"

#include   "../../6/LINKLIST/LIST.H"
#include   "../../6/LINKLIST/LIST.CPP"
#include <string.h>
#include   "../../6/STRINGS/STRING.H"
#include   "../../6/STRINGS/STRING.CPP"
#include "KEY.H"
#include "KEY.CPP"
#include "RECORD.H"
#include "RECORD.CPP"
typedef Record Queue_entry;

#include "../../3/QUEUE/QUEUE.H"
#include "../../3/QUEUE/QUEUE.CPP"

#include "RADIX.H"
const int key_size = 8;
#include "RADIX.CPP"
 
void write_entry(Record &c)
{
   for (int i = 0; i < 8; i++)
      cout << c.key_letter(i);
   cout << "\n";
}
 
main()
{
   List<Record> s; List<Record> t = s;  //  Help the compiler.
   int list_size = 250;
   Random dice;
   char word[9];
   word[8] = '\0';

   int i;
   Sortable_list<Record> the_list;
   for (i = 0; i < list_size; i++) {
      for (int j = 0; j < 8; j++)
         word[j] = dice.random_integer(0,26) + 'a';
         Key target_name = word;
         Record target = target_name;
      if (the_list.insert(i, target) != success) {
         cout << " Overflow in filling list." << endl;
      }
   }

   cout << "Unsorted list \n";
   the_list.traverse(write_entry);
   cout << "\n";
   the_list.radix_sort();
   cout << "\n Sorted list \n";
   the_list.traverse(write_entry);
   cout << "\n";
}