-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathSparseArray.cpp
More file actions
152 lines (146 loc) · 3.46 KB
/
SparseArray.cpp
File metadata and controls
152 lines (146 loc) · 3.46 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
#include <iostream>
#include <iomanip>
#include <string>
using namespace std;
class List
{
private:
int index;
int value;
List *nextindex;
public:
List(int index)
{
this->index = index;
nextindex = NULL;
value = NULL;
}
List()
{
index = -1;
value = NULL;
nextindex = NULL;
}
void store(int index, int value)
{
List *current = this;
List *previous = NULL;
List *node = new List(index);
node->value = value;
while (current != NULL && current->index < index)
{
previous = current;
current = current->nextindex;
}
if (current == NULL)
{
previous->nextindex = node;
}
else
{
if (current->index == index)
{
cout<<"DUPLICATE INDEX"<<endl;
return;
}
previous->nextindex = node;
node->nextindex = current;
}
return;
}
int fetch(int index)
{
List *current = this;
int value = NULL;
while (current != NULL && current->index != index)
{
current = current->nextindex;
}
if (current != NULL)
{
value = current->value;
}
else
{
value = NULL;
}
return value;
}
int elementCount()
{
int elementCount = 0;
List *current = this->nextindex;
for ( ; (current != NULL); current = current->nextindex)
{
elementCount++;
}
return elementCount;
}
};
class SparseArray
{
private:
List *start;
int index;
public:
SparseArray(int index)
{
start = new List();
this->index = index;
}
void store(int index, int value)
{
if (index >= 0 && index < this->index)
{
if (value != NULL)
start->store(index, value);
}
else
{
cout<<"INDEX OUT OF BOUNDS"<<endl;
}
}
int fetch(int index)
{
if (index >= 0 && index < this->index)
return start->fetch(index);
else
{
cout<<"INDEX OUT OF BOUNDS"<<endl;
return NULL;
}
}
int elementCount()
{
return start->elementCount();
}
};
int main()
{
int iarray[5];
iarray[0] = 1;
iarray[1] = NULL;
iarray[2] = 2;
iarray[3] = NULL;
iarray[4] = NULL;
SparseArray sparseArray(5);
for (int i = 0; i < 5; i++)
{
sparseArray.store(i, iarray[i]);
}
cout<<"NORMAL ARRAY"<<endl;
for (int i = 0 ; i < 5; i++)
{
if (iarray[i] == NULL)
cout<<"NULL"<<"\t";
else
cout<<iarray[i] <<"\t";
}
cout<<"\nSPARSE ARRAY"<<endl;
for (int i = 0; i < 5; i++)
{
if (sparseArray.fetch(i) != NULL)
cout<<sparseArray.fetch(i) <<"\t";
}
cout<<"The Size of Sparse Array is "<<sparseArray.elementCount()<<endl;
}