//sortedList11.cpp
//date: 10/02/2002
//author: AOU
//Assignment #3
//Date assigned 09/27/2002
//Date due 10/04/2002
//Develop displayDistinct
// displayDistinctWithCounts
//Algorithms and Implementation for both functions
//Supply detailed documentation for each member function
//Test functions will be supplied and published
//Submit source code, executable code, and the Word doc
// on a diskette; and printed source of class, two functions,
// their documentstion, and the output produced.
//Example:
// {1, 2, 2, 2, 3, 5, 6, 7, 7, 7, 7, 7, 9}
// Distinct: 1, 2, 3, 5, 6, 7, 9
// Value Count
// 1 1
// 2 3
// 3 1
// 5 1
// 6 1
// 7 5
// 9 1
////////////////////////////////////////////////////////////
// Include files
////////////////////////////////////////////////////////////
#include<iostream.h>
#include<math.h>
#include<stdlib.h>
#include<time.h>
////////////////////////////////////////////////////////////
// Constants
////////////////////////////////////////////////////////////
const int ARRAY_SIZE = 10;
const int UNDEFINED = -9999;
const int MAX_VALUE = 5;
const int TEST_COUNT = 10;
////////////////////////////////////////////////////////////
// Test function prototypes
////////////////////////////////////////////////////////////
void testSortBubble2(void);
void testSearchSeq(void);
void testSearchBinary(void);
void testSearchBinaryLM(void);
void testDisplayDistinct(void);
void testDisplayDistinctWithCounts(void);
void testRemove(void);
////////////////////////////////////////////////////////////
// Class CSortedList
////////////////////////////////////////////////////////////
class CSortedList
{
private:
int m_array[ARRAY_SIZE];
int m_count;
int m_min;
int m_max;
void sortBubble1(void);
public:
CSortedList(void);
CSortedList(char ch);
CSortedList(int n); //2002.10.02
void display(void) const;
bool insert(int x);
bool isSorted(void) const;
void sortBubble2(void);
void shuffle(void);
int searchSeq(int x) const;
int searchBinary(int x) const; //2002.09.23
int searchBinaryLM(int x) const; //2002.09.25
void displayDistinct(void) const;
void displayDistinctWithCounts(void) const;
bool remove(int x); //2002.09.30
int getAt(int p) //2002.10.02
{
if ((p < m_count) && (p >= 0))
return this->m_array[p];
else
return UNDEFINED;
};
};
////////////////////////////////////////////////////////////
// main function
////////////////////////////////////////////////////////////
void main(void)
{
srand(time(NULL));
//testSortBubble2();
//testSearchSeq();
//testSearchBinary();
//testSearchBinaryLM();
//testDisplayDistinct();
//testDisplayDistinctWithCounts();
testRemove();
}
////////////////////////////////////////////////////////////
// CSortedList(int n)
////////////////////////////////////////////////////////////
CSortedList::CSortedList(int n)
{
this->m_count = 0;
int x;
for (int i=0; i<n; i++)
{
x = rand()%(MAX_VALUE+1);
this->insert(x);
}
}
////////////////////////////////////////////////////////////
// remove(x)
////////////////////////////////////////////////////////////
/*
Algorithm0:
Search for x
if not found return false
put position of x in p
shiftLeft all values on right of p
return true
Algorithm1:
Search for x
if not found return false
put position of x in p
for i= p to count-2
array[i] = array[i+1]
end for
count--
return true
*/
bool CSortedList::remove(int x)
{
int p = searchSeq(x);
if (-1 == p)
return false;
//shift left starting at p+1
for (int i=p; i<=m_count-2; i++)
m_array[i] = m_array[i+1];
this->m_count--;
return true;
}
////////////////////////////////////////////////////////////
// testRemove()
////////////////////////////////////////////////////////////
void testRemove(void)
{
/*
TEST CASES0:
list with count=0
list with count=1, x is not in the list
list with count=1, x is in the list
list with count=2, x is not in the list
list with count=2, x is at 0 position
list with count=2, x is at count-1 position
list with count>2, x is not in the list
list with count>2, x is at 0 position
list with count>2, x is at count-1 position
list with count>2, x is at position [1..count-2]
-------------------------------------------------
TEST CASES1:
list with count=0
list with count=1, x is not in the list
list with count=1, x is in the list
list with count>1, x is not in the list
list with count>1, x is at 0 position
list with count>1, x is at count-1 position
list with count>2, x is at position [1..count-2]
*/
cout << "Random cases:\n\n";
for (int j=1; j<=5; j++)
{
CSortedList myList('r');
int x;
bool result;
myList.display();
for (int i=0; i<10; i++)
{
x = rand()%(MAX_VALUE+1);
result = myList.remove(x);
if (result)
cout << x << " was deleted from the list\n";
else
cout << x << " could not be deleted from the list\n";
myList.display();
cout << endl;
}
cout << "----------------------------------\n";
}
//list with count=0
{
cout << "//list with count=0\n\n";
CSortedList myList;
int x;
bool result;
myList.display();
x = rand()%(MAX_VALUE+1);
result = myList.remove(x);
if (result)
cout << x << " was deleted from the list\n\n";
else
cout << x << " could not be deleted from the list\n";
myList.display();
cout << "********************************" << endl;
}
//list with count=1, x is not in the list
{
cout << "//list with count=1, x is not in the list\n\n";
CSortedList myList(1);
int x = MAX_VALUE+1;
bool result;
myList.display();
result = myList.remove(x);
if (result)
cout << x << " was deleted from the list\n";
else
cout << x << " could not be deleted from the list\n";
myList.display();
cout << "********************************" << endl;
}
//list with count=1, x is in the list
{
cout << "//list with count=1, x is in the list\n\n";
CSortedList myList(1);
int x = myList.getAt(0);
bool result;
myList.display();
result = myList.remove(x);
if (result)
cout << x << " was deleted from the list\n";
else
cout << x << " could not be deleted from the list\n";
myList.display();
cout << "********************************" << endl;
}
//list with count>1, x is not in the list
//list with count>1, x is at 0 position
//list with count>1, x is at count-1 position
//list with count>2, x is at position [1..count-2]
}
////////////////////////////////////////////////////////////
// displayDistinctWithCounts()
////////////////////////////////////////////////////////////
void CSortedList::displayDistinctWithCounts(void) const
{
cout << "Missing code for displayDistinctWithCounts\n";
}
////////////////////////////////////////////////////////////
// testDisplayDistinctWithCounts()
////////////////////////////////////////////////////////////
void testDisplayDistinctWithCounts(void)
{
for (int j=1; j<=TEST_COUNT; j++)
{
CSortedList myList('r');
myList.display();
myList.displayDistinctWithCounts();
cout << "-----------------\n";
}
}
////////////////////////////////////////////////////////////
// displayDistinct()
////////////////////////////////////////////////////////////
void CSortedList::displayDistinct(void) const
{
cout << "Missing code for displayDistinct\n";
}
////////////////////////////////////////////////////////////
// testDisplayDistinct()
////////////////////////////////////////////////////////////
void testDisplayDistinct(void)
{
for (int j=1; j<=TEST_COUNT; j++)
{
CSortedList myList('r');
myList.display();
myList.displayDistinct();
cout << "-----------------\n";
}
}
////////////////////////////////////////////////////////////
// searchBinaryLM(x)
////////////////////////////////////////////////////////////
/*
Given sorted array[0..count-1], x
[12, 23, 23, 29, 32], 23 => 1
[12, 23, 27, 27, 32], 24 => 2
Algorithm0:
Find the position of x in p using binary search
if not found then return -1
while (value at p-1 is same as at p)
p--
end while
*/
int CSortedList::searchBinaryLM(int x) const
{
int p;
p = this->searchBinary(x);
if (-1 == p)
return -1;
while((p>0) && (this->m_array[p] == this->m_array[p-1]))
p--;
return p;
}
////////////////////////////////////////////////////////////
// testSearchBinaryLM
////////////////////////////////////////////////////////////
void testSearchBinaryLM(void)
{
for (int j=1; j<=5; j++)
{
CSortedList myList('r');
int x, p1, p2;
myList.display();
for (int i=0; i<10; i++)
{
x = rand()%(MAX_VALUE+1);
p1 = myList.searchBinaryLM(x);
cout << x << " was found at position " << p1 << endl;
p2 = myList.searchSeq(x);
cout << x << " was found at position " << p2 << endl;
if (p1 != p2)
cout << "***************************\n";
cout << endl;
}
cout << "-----------------\n";
}
}
////////////////////////////////////////////////////////////
// searchBinary(x)
////////////////////////////////////////////////////////////
/*
Given sorted array[0..count-1], x
[12, 23, 27, 29, 32], 27 => 2
[12, 23, 27, 29, 32], 24 => -1
Algorithm0:
while there is a list to be searched
calculate mid point of the list to be searched
if x = array[mid] then return mid
find out which half of the list to be searched
end while
Algorithm1:
*/
int CSortedList::searchBinary(int x) const
{
int lower, upper, mid;
lower = 0;
upper = this->m_count-1;
while (lower <= upper)
{
mid = (lower+upper)/2;
if (x == this->m_array[mid])
return mid;
if (x < this->m_array[mid])
upper = mid-1;
if (x > this->m_array[mid])
lower = mid+1;
}
return -1;
}
////////////////////////////////////////////////////////////
// testSearchBinary
////////////////////////////////////////////////////////////
void testSearchBinary(void)
{
for (int j=1; j<=5; j++)
{
CSortedList myList('r');
int x, p;
myList.display();
for (int i=0; i<10; i++)
{
x = rand()%(MAX_VALUE+1);
p = myList.searchBinary(x);
cout << x << " was found at position " << p << endl;
p = myList.searchSeq(x);
cout << x << " was found at position " << p << endl;
}
cout << "-----------------\n";
}
}
////////////////////////////////////////////////////////////
// searchSeq(x)
////////////////////////////////////////////////////////////
/*Given sorted array[0..count-1], x
[12, 23, 27, 29, 32], 27 => 2
[12, 23, 27, 29, 32], 24 => -1
Algorithm0:
search for x from left to right in array[]
if found return the position
return -1
Algorithm1:
for i=0 to count-1 do the following
if x = array[i] then return i
end for
return -1
Algorithm2:
for i=0 to count-1 do the following
if x = array[i] then return i
if x < array[i] then exit for loop
end for
return -1
*/
int CSortedList::searchSeq(int x) const
{
for (int i=0; i<=this->m_count-1; i++)
{
if (x == m_array[i])
return i;
if (x < this->m_array[i])
break;
}
return -1;
}
////////////////////////////////////////////////////////////
// testSearchSeq
////////////////////////////////////////////////////////////
void testSearchSeq(void)
{
for (int j=1; j<=5; j++)
{
CSortedList myList('r');
int x, p;
myList.display();
for (int i=0; i<10; i++)
{
x = rand()%(MAX_VALUE+1);
p = myList.searchSeq(x);
cout << x << " was found at position " << p << endl;
}
cout << "-----------------\n";
}
}
////////////////////////////////////////////////////////////
// CSortedList(void)
////////////////////////////////////////////////////////////
CSortedList::CSortedList(void)
{
this->m_count = 0;
this->m_min = UNDEFINED;
this->m_max = UNDEFINED;
}
////////////////////////////////////////////////////////////
// CSortedList(char ch)
////////////////////////////////////////////////////////////
CSortedList::CSortedList(char ch)
{
this->m_count = 0;
int x, n;
if ('r' == ch)
{
n = rand()%ARRAY_SIZE+1;
for (int i=0; i<n; i++)
{
x = rand()%(MAX_VALUE+1);
this->insert(x);
}
}
}
////////////////////////////////////////////////////////////
// display(void)
////////////////////////////////////////////////////////////
void CSortedList::display(void) const
{
cout << "SortedList(" << this->m_count << ")= ";
for (int i=0; i<this->m_count; i++)
cout << this->m_array[i] << ' ';
cout << endl;
}
////////////////////////////////////////////////////////////
// insert(int x)
////////////////////////////////////////////////////////////
bool CSortedList::insert(int x)
{
//allow duplicate values
/*
there is no room then return false
there is room then add to the end, sort, return true
*/
if (ARRAY_SIZE == this->m_count)
return false;
else
{
this->m_array[m_count] = x;
this->m_count++;
this->sortBubble1();
return true;
}
}
////////////////////////////////////////////////////////////
// sortBubble1(void)
////////////////////////////////////////////////////////////
void CSortedList::sortBubble1(void)
{
int j;
for (int i=1; i<=this->m_count-1; i++)
{
for (j=0; j<=this->m_count-2; j++)
{
if (this->m_array[j] > this->m_array[j+1])
{
int temp = this->m_array[j];
this->m_array[j] = this->m_array[j+1];
this->m_array[j+1] = temp;
}
}
}
}
////////////////////////////////////////////////////////////
// sortBubble2(void)
////////////////////////////////////////////////////////////
/*
Algorithm0:
do
swaps =0
make one pass trying to put items in order
until swaps == 0
Algorithm1:
sorted = false
while not sorted
sorted = true
make one pass trying to put items in order
end while
Algorithm2:
sorted = false
while not sorted
sorted = true
for i= 0 to m_count-2 do the following
if m_array[i] > m_array[i+1] then
swap m_array[i], m_array[i+1]
sorted = false
end if
end for
end while
*/
void CSortedList::sortBubble2(void)
{
this->sortBubble1();
}
////////////////////////////////////////////////////////////
// testSortBubble2(void)
////////////////////////////////////////////////////////////
void testSortBubble2(void)
{
for (int i=1; i<=10; i++)
{
CSortedList myList('r');
cout << "Original list\n";
myList.display();
if (myList.isSorted())
cout << " List is SORTED\n";
else
cout << " List is NOT SORTED\n";
myList.shuffle();
cout << "Shuffled list\n";
myList.display();
if (myList.isSorted())
cout << " List is SORTED\n";
else
cout << " List is NOT SORTED\n";
myList.sortBubble2();
cout << "After sortBubble2\n";
myList.display();
if (myList.isSorted())
cout << " List is SORTED\n";
else
cout << " List is NOT SORTED\n";
cout << "-------------------\n";
}
}
////////////////////////////////////////////////////////////
// isSorted(void)
////////////////////////////////////////////////////////////
bool CSortedList::isSorted(void) const
{
for (int i=0; i<=this->m_count-2; i++)
if (this->m_array[i] > this->m_array[i+1])
return false;
return true;
}
////////////////////////////////////////////////////////////
// shuffle(void)
////////////////////////////////////////////////////////////
void CSortedList::shuffle(void)
{
int picked, temp;
for (int i=0; i<=this->m_count-1; i++)
{
picked = rand()%this->m_count;
temp = this->m_array[0];
this->m_array[0] = this->m_array[picked];
this->m_array[picked] = temp;
}
}
/*
SAMPLE RUN:
Random cases:
SortedList(3)= 3 3 4
4 was deleted from the list
SortedList(2)= 3 3
2 could not be deleted from the list
SortedList(2)= 3 3
4 could not be deleted from the list
SortedList(2)= 3 3
3 was deleted from the list
SortedList(1)= 3
2 could not be deleted from the list
SortedList(1)= 3
3 was deleted from the list
SortedList(0)=
0 could not be deleted from the list
SortedList(0)=
0 could not be deleted from the list
SortedList(0)=
3 could not be deleted from the list
SortedList(0)=
3 could not be deleted from the list
SortedList(0)=
----------------------------------
SortedList(4)= 0 3 3 5
0 was deleted from the list
SortedList(3)= 3 3 5
0 could not be deleted from the list
SortedList(3)= 3 3 5
3 was deleted from the list
SortedList(2)= 3 5
3 was deleted from the list
SortedList(1)= 5
1 could not be deleted from the list
SortedList(1)= 5
4 could not be deleted from the list
SortedList(1)= 5
1 could not be deleted from the list
SortedList(1)= 5
4 could not be deleted from the list
SortedList(1)= 5
0 could not be deleted from the list
SortedList(1)= 5
2 could not be deleted from the list
SortedList(1)= 5
----------------------------------
SortedList(6)= 0 1 3 3 4 5
3 was deleted from the list
SortedList(5)= 0 1 3 4 5
5 was deleted from the list
SortedList(4)= 0 1 3 4
2 could not be deleted from the list
SortedList(4)= 0 1 3 4
1 was deleted from the list
SortedList(3)= 0 3 4
3 was deleted from the list
SortedList(2)= 0 4
1 could not be deleted from the list
SortedList(2)= 0 4
0 was deleted from the list
SortedList(1)= 4
1 could not be deleted from the list
SortedList(1)= 4
1 could not be deleted from the list
SortedList(1)= 4
4 was deleted from the list
SortedList(0)=
----------------------------------
SortedList(2)= 0 5
4 could not be deleted from the list
SortedList(2)= 0 5
5 was deleted from the list
SortedList(1)= 0
1 could not be deleted from the list
SortedList(1)= 0
1 could not be deleted from the list
SortedList(1)= 0
1 could not be deleted from the list
SortedList(1)= 0
1 could not be deleted from the list
SortedList(1)= 0
5 could not be deleted from the list
SortedList(1)= 0
1 could not be deleted from the list
SortedList(1)= 0
2 could not be deleted from the list
SortedList(1)= 0
5 could not be deleted from the list
SortedList(1)= 0
----------------------------------
SortedList(4)= 0 0 4 5
1 could not be deleted from the list
SortedList(4)= 0 0 4 5
1 could not be deleted from the list
SortedList(4)= 0 0 4 5
1 could not be deleted from the list
SortedList(4)= 0 0 4 5
5 was deleted from the list
SortedList(3)= 0 0 4
2 could not be deleted from the list
SortedList(3)= 0 0 4
5 could not be deleted from the list
SortedList(3)= 0 0 4
0 was deleted from the list
SortedList(2)= 0 4
4 was deleted from the list
SortedList(1)= 0
3 could not be deleted from the list
SortedList(1)= 0
2 could not be deleted from the list
SortedList(1)= 0
----------------------------------
//list with count=0
SortedList(0)=
4 could not be deleted from the list
SortedList(0)=
********************************
//list with count=1, x is not in the list
SortedList(1)= 5
6 could not be deleted from the list
SortedList(1)= 5
********************************
//list with count=1, x is in the list
SortedList(1)= 4
4 was deleted from the list
SortedList(0)=
********************************
Press any key to continue
*/
|