Data-Structure-Algorithm/Array.cpp at main · aruncode49/Data-Structure-Algorithm · GitHub

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
#include<stdio.h>
#include<iostream>
using namespace std;

class Array
{
    private:
        int capacity;
        int lastIndex;
        int *p;
    public:
        Array(int);
        bool is_empty();
        bool is_full();
        void append(int);
        void insert(int,int);
        void edit(int,int);
        void del(int);
        int getItem(int);
        int count();
        int getElementIndex(int);
        ~Array();
};

Array::Array(int)
{
    p=NULL;
}

Array::Array (int size)
{
    capacity = size;
    lastIndex = -1;
    if(p != NULL)
        delete []p;
    p = new int[capacity];
}

bool Array::is_empty()
{
    return (lastIndex == -1);
}

bool Array::is_full()
{
    return (lastIndex+1 == capacity);
}

void Array::append(int data)
{
    if(!is_full())
    {
        lastIndex++;
        p[lastIndex]=data;
    }
    else
        cout<<"Overflow: appending not possible";
}

void Array::insert(int index, int data)
{
    int i;
    try{
        if(index<0 || index > lastIndex+1)
            throw 1;
        if(is_full())
            throw 2;
        for(i = lastIndex; i>=index; i--)
            p[i+1] = p[i];
        p[index] = data;
        lastIndex++;
    }
    catch(int e){
        if(e==1)
           cout<<"Invalid Index";
        else if(e==2)
            cout<<"Array is full, so insert of new element is not possible.";
    }
}

void Array::edit(int index, int data)
{
    try{
        if(index<0 || index > lastIndex+1)
            throw 1;
        p[index] = data;
    }
    catch(int e)
    {
        if(e==1)
           cout<<"Invalid Index";
    }
}

void Array::del(int index)
{
    int i;
    try{
        if(index < 0 || index > capacity)
            throw 1;
        for(i = index; i < lastIndex; i++)
            p[i] = p[i+1];
        lastIndex--;
    }
    catch(int e){
        if(e==1)
        cout<<"Invalid Index";
    }
}

int Array::getItem(int index)
{
    try{
        if(index < 0 || index > lastIndex)
            throw 1;
        return p[index];
    }
    catch(int e){
        if(e==1)
            cout<<"Invalid Index";
    }
    return -1;
}

int Array::count()
{
    return lastIndex+1;
}

int Array::getElementIndex(int element)
{
    int i;
    for(i=0; i<=lastIndex; i++)
    {
        if(p[i] == element)
            return i;
        else
            return -1;
    }
}

Array::~Array()
{
    delete []p;
    // program end here
}