pex8_1.cpp

数据结构C++代码,经典代码,受益多多,希望大家多多支持

#include <iostream.h>
#include <stdlib.h>
#pragma hdrstop

#include "random.h"
#include "utils.h"
#include "wex8_3.h"

// "<" for two DynamicInt objects
int operator< (DynamicInt &a, DynamicInt &b)
{
	// compare their values
	return a.GetVal() < b.GetVal();
}

// generate a dynamic array of n DynamicInt objects having
// random values in the range 1..1000
DynamicInt *Initialize(int n)
{
	// use one random sequence
	static RandomNumber rnd;
	// allocate a dynamic array of n objects,
	// each with initial value 0
	DynamicInt *p = new DynamicInt[n];
	
	// if the memory allocation failed, terminate the program
	if (p == NULL)
	{
		cerr << "Initialize: memor allocation failed!" << endl;
		exit(1);
	}
	
	// reassign the object values to random integers in range 1..1000
	for (int i = 0; i < n; i++)
		p[i].SetVal(rnd.Random(1000) + 1);
		
	// return address of the dynamic array
	return p;
}

void main(void)
{
	int n;
	DynamicInt *p;
	
	cout << "How many DynamicInt objects in the array? ";
	cin >> n;
	
	// create n objects with random values
	p = Initialize(n);
	
	// sort the array using the exchange sort. note that
	// the "<" operator is used by the sort function
	ExchangeSort(p,n);
	
	// output the sorted objects
	for (int i = 0; i < n; i++)
		cout << p[i] << "  ";
	cout << endl;
}

/*
<Run>

How many DynamicInt objects in the array? 10
24  272  348  374  465  474  737  888  938  978
*/