-
Notifications
You must be signed in to change notification settings - Fork 15
/
Copy pathpqusingarr.java
109 lines (93 loc) · 2.46 KB
/
pqusingarr.java
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
import java.util.*;
public class pqusingarr
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
pq p=new pq();
p.add(3);
p.add(2);
p.add(5);
p.print();
System.out.println();
System.out.println(p.getPeek());
System.out.println(p.isEmpty());
System.out.println("SIZE: "+p.size());
System.out.println(p.remove());
System.out.println("SIZE: "+p.size());
p.print();
}
}
class pq
{
int arr[]=new int[10];
int nitems=0;
public void add(int d)
{
if(nitems==0)
{
arr[0]=d;
nitems++;
return; //istoh bhar aana matlab eh hai
}
int i;
for(i=nitems-1;i>=0;i--)
{
if(d<arr[i]) //jehra apa krya eh ascending h //descending order krn lyi max to min d>arr[i]
{
arr[i+1]=arr[i];
}
else
{
break;
}
}
arr[i+1]=d; // hun i di value ghat gyi eh for toh bhar h
nitems++;
// else
// {
// for(int j=0;j<=i;j++)
// {
// if(d<arr[j])
// {
// arr[i-1]=
// }
// else
// {
// arr[i]=d;
// i++;
// }
// }
// }
}
public void print()
{
for(int j=0;j<nitems;j++)
{
System.out.print(arr[j]+" ");
}
}
public boolean isEmpty()
{
// if(nitems<0)
// return true;
// else
// return false;
return nitems==0; //another thing
}
public int size()
{
return nitems;
}
public int getPeek()
{
return arr[nitems-1];
}
public int remove() //poll
{
// int val=arr[nitems];
// nitems--;
// return val;
return arr[--nitems]; //pre m=minus both things done in one line
}
}