paullewallencom

#ifndef AVL_TREE_H
#define AVL_TREE_H

#include "dsexceptions.h"
#include <algorithm>
#include <iostream> 
using namespace std;

template <typename Comparable>
class AvlTree

paullewallencom

#ifndef BINARY_SEARCH_TREE_H
#define BINARY_SEARCH_TREE_H

#include "dsexceptions.h"
#include <algorithm>
using namespace std;       

template <typename Comparable>
class BinarySearchTree
{

paullewallencom

#ifndef LIST_H
#define LIST_H

#include <algorithm>
using namespace std;

template <typename Object>
class List
{
  private:    

paullewallencom

#ifndef VECTOR_H
#define VECTOR_H

#include <algorithm>
#include <iostream>
#include <stdexcept>
#include "dsexceptions.h"

template <typename Object>
class Vector

paullewallencom

#include "IntCell.h"

IntCell::IntCell( int initialValue ) : storedValue{ initialValue }
{
}

int IntCell::read( ) const
{
    return storedValue;
}

paullewallencom

struct node heada, headb;
link t, u, x, a = &heada, b;

for ( i = 0, t = a; i < N; i++ )
{
    t->next = malloc( sizeof *t ); 
    t = t->next; t->next = NULL;
    t->item = rand() % 1000; 
}
b = &headb; b->next = NULL;

paullewallencom

#include <iostream>
#include <vector>
using namespace std;

const int NOT_FOUND = -1;

template <typename Comparable>
int binarySearch( const vector<Comparable> & a, const Comparable & x )
{
    int low = 0, high = a.size( ) - 1;

paullewallencom

int search( int a[], int v, int l, int r )
{
    int i;

    for ( i = l; i <= r; i++ )
      if ( v == a[ i ] ) return i;
    return -1;
}

paullewallencom

#include <stdio.h>
#define N 10000
main()
{
    int i, j, p, q, id[ N ], sz[ N ];

    for ( i = 0; i < N; i++ ) 
    {
        id[ i ] = i; sz[ i ] = 1;
    }

paullewallencom

#include <stdio.h>
#define N 10000
main()
{
    int i, p, q, t, id[ N ];

    for ( i = 0; i < N; i++ ) id[ i ] = i;

    while ( scanf( "%d %d\n", &p, &q ) == 2 )
    {