Skip to content
Navigation Menu
{{ message }}
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArray.java
More file actions
366 lines (339 loc) · 10.2 KB
/
Copy pathArray.java
File metadata and controls
366 lines (339 loc) · 10.2 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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
package com.course.objects;
/**
*
* @author avoidcloud
*/
public class Array {
private int size;
private int length;
private int[] data;
private String Order;
public Array(int size) {
this.size = size;
data = new int[size];
length = 0;
}
public Array(){
size = 10;
data = new int[size];
length = 0;
}
/* Insert Methods*/
public void push_back(int element){
if(length<size){
data[length] = element;
length++;
}
}
public void push_front(int element){
if(length<size){
for(int i=0; i<length; i++){
data[i+1] = data[i];
}
data[0] = element;
length++;
}
}
public void insertAt(int index, int element){
if(index<length && length<size){
for(int i=index; i<length; i++){
data[i+1] = data[i];
}
data[index] = element;
length++;
}
}
/* delete methods*/
public int pop_back(){
if(length > 0){
length--;
return data[length];
}
return 0;
}
public int pop_front(){
if(length > 0){
int element = data[0];
for(int i=1; i<length; i++){
data[i-1] = data[i];
}
length--;
return element;
}
return 0;
}
/* Array's status methods*/
public int length(){
return length;
}
public boolean isEmpty(){
if(length > 0)
return false;
return true;
}
public void show(){
for(int i=0; i<length; i++)
System.out.print(data[i]+" ");
System.out.println();
}
/* set a full array */
public void setArray(int[] array){
if(array.length <= size){
size = array.length;
data = array;
length = size;
}
else{
for(int i=0; i<size; i++){
data[i] = array[i];
}
length = size;
}
}
/*:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
:::::::::::::::::::::::::: Sorting Algorithms ::::::::::::::::::::::::::::::::
::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*/
/*-------------------Bubble Sort-------------------------*/
public void BubbleSort(String Order){
Order = Order.toLowerCase();
this.Order = Order;
if(Order.equals("asc")){
for(int i=0; i<length-1; i++){
for(int j=i+1; j<length; j++){
if(data[i] > data[j]){
int temp = data[i];
data[i] = data[j];
data[j] = temp;
}
}
}
}
else if(Order.equals("des")){
for(int i=0; i<length-1; i++){
for(int j=i+1; j<length; j++){
if(data[i] < data[j]){
int temp = data[i];
data[i] = data[j];
data[j] = temp;
}
}
}
}
}
/* Bubble Sort Overloading*/
public void BubbleSort(){
Order = "asc";
for(int i=0; i<length-1; i++){
for(int j=i+1; j<length; j++){
if(data[i] > data[j]){
int temp = data[i];
data[i] = data[j];
data[j] = temp;
}
}
}
}
/*------------------- Merge Sort -------------------------*/
public void MergeSort(String Order){
Order = Order.toLowerCase();
this.Order = Order;
MergeSort(0, length-1);
}
/* Merge Sort OverLoading*/
public void MergeSort(){
Order = "asc";
MergeSort(0, length-1);
}
/* Merge sort functionality*/
private void MergeSort(int start, int stop){
if(start<stop){
int mid = start + (stop-start)/2;
MergeSort(start, mid);
MergeSort(mid+1, stop);
MergeArray(start, mid, stop);
}
}
private void MergeArray(int start, int mid, int stop){
int leftLength = mid - start + 1;
int rightLength = stop - mid ;
int[] leftData = new int[leftLength];
int[] rightData = new int[rightLength];
for(int i=0; i<leftLength; i++){
leftData[i] = data[start+i];
}
for(int i=0; i<rightLength; i++){
rightData[i] = data[mid+1+i];
}
int index = start, leftIndex = 0, rightIndex = 0;
if(Order.equals("asc")){
while(leftIndex<leftLength && rightIndex<rightLength){
if(leftData[leftIndex] < rightData[rightIndex]){
data[index] = leftData[leftIndex];
index++;
leftIndex++;
}
else{
data[index] = rightData[rightIndex];
index++;
rightIndex++;
}
}
while(leftIndex<leftLength){
data[index] = leftData[leftIndex];
index++;
leftIndex++;
}
while(rightIndex<rightLength){
data[index] = rightData[rightIndex];
index++;
rightIndex++;
}
}
else {
while(leftIndex<leftLength && rightIndex<rightLength){
if(leftData[leftIndex] > rightData[rightIndex]){
data[index] = leftData[leftIndex];
index++;
leftIndex++;
}
else{
data[index] = rightData[rightIndex];
index++;
rightIndex++;
}
}
while(leftIndex<leftLength){
data[index] = leftData[leftIndex];
index++;
leftIndex++;
}
while(rightIndex<rightLength){
data[index] = rightData[rightIndex];
index++;
rightIndex++;
}
}
}
/*---------------------------Quick Sort---------------------*/
public void QuickSort(String Order){
Order = Order.toLowerCase();
this.Order = Order;
QuickSort(0, length-1);
}
public void QuickSort(){
Order = "asc";
QuickSort(0, length-1);
}
/* Quick Sort Functionality */
private void QuickSort(int start, int stop){
if(start < stop){
int pivot = fixedIndex(start, stop);
QuickSort(start, pivot-1);
QuickSort(pivot+1, stop);
}
}
private int fixedIndex(int start, int stop){
int index = start;
int value = data[stop];
if(Order.equals("asc")){
for(int i=start; i<stop; i++){
if(data[i] < value){
int temp = data[i];
data[i] = data[index];
data[index] = temp;
index++;
}
}
int temp = data[stop];
data[stop] = data[index];
data[index] = temp;
return index;
}
else if(Order.equals("des")){
for(int i=start; i<stop; i++){
if(data[i] > value){
int temp = data[i];
data[i] = data[index];
data[index] = temp;
index++;
}
}
int temp = data[stop];
data[stop] = data[index];
data[index] = temp;
return index;
}
else
return stop;
}
public void InsertionSort(){
Order = "asc";
for(int i=1; i<length; i++){
int index = i;
int value = data[i];
while(index > 0 && data[index-1] > value){
data[index] = data[index-1];
index--;
}
data[index] = value;
}
}
public void InsertionSort(String Order){
Order = Order.toLowerCase();
this.Order = Order;
if(Order.equals("asc")){
for(int i=1; i<length; i++){
int index = i;
int value = data[i];
while(index > 0 && data[index-1] > value){
data[index] = data[index-1];
index--;
}
data[index] = value;
}
}
else if(Order.equals("des")){
for(int i=1; i<length; i++){
int index = i;
int value = data[i];
while(index > 0 && data[index-1] < value){
data[index] = data[index-1];
index--;
}
data[index] = value;
}
}
}
/*::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
------------------------ Binary Search --------------------------
::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*/
public int Search(int item){
return BinarySearch(0, length, item);
}
/* Binary Search functionality */
private int BinarySearch(int start, int stop, int item){
if(Order.equals("asc")){
while(start<=stop){
int mid = start + (stop-start)/2;
if(data[mid] == item)
return mid;
else if(data[mid] < item)
start = mid+1;
else
stop = mid - 1;
}
}
else if(Order.equals("des")){
while(start<=stop){
int mid = start + (stop-start)/2;
if(data[mid] == item)
return mid;
else if(data[mid] > item)
start = mid+1;
else
stop = mid - 1;
}
}
return -1;
}
}
You can’t perform that action at this time.