pubJ1c booJeah 1sEmpty{} {

etuh {hTtems == u},

}
pubJ1c booJeah 1sFuJJ{} {
etuh {hTtems == max51ze},
}
pubJ1c 1ht s1ze{} {
etuh hTtems,
}
pubJ1c stat1c vo1d ma1h{5t1hg| ags} {
ueue theueue = heW ueue{5}, // queue holds 5 items
theueue.1hset{1u},
theueue.1hset{2u},
theueue.1hset{3u},
theueue.1hset{4u},
theueue.emove{},
theueue.emove{},
theueue.emove{},
theueue.1hset{5u},
theueue.1hset{u}, // (wraps around)
theueue.1hset{7u},
theueue.1hset{Bu},
Wh1Je {!theueue.1sEmpty{}} {
Johg h = theueue.emove{}, // (40, 50, 60, 70, 80)
5ystem.out.p1ht{h},
5ystem.out.p1ht{" "},
}
5ystem.out.p1htJh{""},
}
}
Task 5: Get Iamiliar with writing a simple Stack in Java
pubJ1c cJass hy5tack {
p1vate 1ht max51ze,
p1vate Johg| stackAay,
p1vate 1ht top,
pubJ1c hy5tack{1ht s} {
max51ze = s,
stackAay = heW Johg|max51ze,
top = -1,
}
pubJ1c vo1d push{Johg } {
stackAay|++top = ,
}
pubJ1c Johg pop{} {
etuh stackAay|top--,
}
pubJ1c Johg peek{} {
etuh stackAay|top,
}
pubJ1c booJeah 1sEmpty{} {
etuh {top == -1},
}
pubJ1c booJeah 1sFuJJ{} {
etuh {top == max51ze - 1},
}
pubJ1c stat1c vo1d ma1h{5t1hg| ags} {
hy5tack the5tack = heW hy5tack{1u}, // make new stack
the5tack.push{2u},
the5tack.push{4u},
the5tack.push{u},
the5tack.push{Bu},
Wh1Je {!the5tack.1sEmpty{}} {
Johg vaJue = the5tack.pop{},
5ystem.out.p1ht{vaJue},
5ystem.out.p1ht{" "},
}
5ystem.out.p1htJh{""},
}
}
Task 6: Get Iamiliar with writing a method Ior Selection Sort in Java
pubJ1c 1ht| seJect1oh5ot{1ht| data}{
1ht Jehu = data.Jehgth,
1ht = u,
1ht tmp = u,
fo{1ht 1=u,1<Jehu,1++}{
= 1,
fo{1ht k = 1,k<Jehu,k++}{
1f{data|>data|k}{
= k,
}
}
tmp = data|1,
data|1 = data|,
data| = tmp,
}
etuh data, }
Task 7: Get Iamiliar with writing a method Ior Insertion Sort in Java
pubJ1c 1ht| Thset1oh5ot{1ht| data}{
1ht Jeh = data.Jehgth,
1ht key = u,
1ht 1 = u,
fo{1ht = 1,<Jeh,++}{
key = data|,
1 = -1,
Wh1Je{1>=u 88 data|1>key}{
data|1+1 = data|1,
1 = 1-1,
data|1+1=key,
}
}
etuh data,
}
Task 8: Get Iamiliar with writing a method Ior Bubble Sort in Java
pubJ1c 1ht| bubbJe5ot{1ht| data}{
1ht Jehu = data.Jehgth,
1ht tmp = u,
fo{1ht 1 = u,1<Jehu,1++}{
fo{1ht = {Jehu-1},>={1+1},--}{
1f{data|<data|-1}{
tmp = data|,
data|=data|-1,
data|-1=tmp,
}
}
}
etuh data,
}
Task 9: Get Iamiliar with writing a method Ior Quick Sort in Java
pubJ1c 1ht| qu1ck5ot{1ht| data}{
1ht Jehu = data.Jehgth,
1ht p1vot = u,
1ht 1hd = Jehu72,
1ht 1, = u,k = u,
1f{Jehu<2}{
etuh data,
}
eJse{
1ht| L = heW 1ht|Jehu,
1ht| R = heW 1ht|Jehu,
1ht| soted = heW 1ht|Jehu,
p1vot = data|1hd,
fo{1=u,1<Jehu,1++}{
1f{1!=1hd}{
1f{data|1<p1vot}{
L| = data|1,
++,
}
eJse{
R|k = data|1,
k++,
}
}
}
1ht| sotedL = heW 1ht|,
1ht| sotedR = heW 1ht|k,
5ystem.aaycopy{L, u, sotedL, u, },
5ystem.aaycopy{R, u, sotedR, u, k},
sotedL = qu1ck5ot{sotedL},
sotedR = qu1ck5ot{sotedR},
5ystem.aaycopy{sotedL, u, soted, u, },
soted| = p1vot,
5ystem.aaycopy{sotedR, u, soted, +1, k},
etuh soted,
}
}
Task 10: Get Iamiliar with writing a method Ior Merge Sort in Java
pubJ1c 1ht| mege5ot{1ht| data}{
1ht Jehu = data.Jehgth,
1f{Jehu<=1}{
etuh data,
}
eJse{
1ht| soted = heW 1ht|Jehu,
1ht m1ddJe = Jehu72,
1ht em = Jehu-m1ddJe,
1ht| L = heW 1ht|m1ddJe,
1ht| R = heW 1ht|em,
5ystem.aaycopy{data, u, L, u, m1ddJe},
5ystem.aaycopy{data, m1ddJe, R, u, em},
L = th1s.mege5ot{L},
R = th1s.mege5ot{R},
soted = mege{L, R},
etuh soted,
}
}
pubJ1c 1ht| mege{1ht| L, 1ht| R}{
1ht JehL = L.Jehgth,
1ht JehR = R.Jehgth,
1ht| meged = heW 1ht|JehL+JehR,
1ht 1 = u,
1ht = u,
Wh1Je{1<JehL||<JehR}{
1f{1<JehL 8 <JehR}{
1f{L|1<=R|}{
meged|1+ = L|1,
1++,
}
eJse{
meged|1+ = R|,
++,
}
}
eJse 1f{1<JehL}{
meged|1+ = L|1,
1++,
}
eJse 1f{<JehR}{
meged|1+ = R|,
++,
}
}
etuh meged,
}