init:
deps-jar:
Compiling 1 source file to /media/disk/Files/Books/ADT/programs/ADT_PRIORITYQUEUE/Heap/build/classes
compile-single:
run-single:
N = 10
CmakeHeap(10) = 14
SumCremove(10) = 21
T(10) = 35
x = 0.3219280948873626
alpha = 1.9219280948873623
Calculated worst-case running time is are:
CmakeHeap = 31 SumCremove = 32 Csort = 63
Theoretic worst-case lower bound is 22 = Math.ceil(N*(Math.log(N)/Math.log(2))- 1.443*N + 2.9)
Theoretic average-case lower bound is 21.29024499631731 = ((N+0.5)*(Math.log(N)/Math.log(2))- 1.45*N + 0.91)
N = 100
CmakeHeap(100) = 190
SumCremove(100) = 877
T(100) = 1067
x = 0.6438561897747253
alpha = 1.9238561897747246
Calculated worst-case running time is are:
CmakeHeap = 240 SumCremove = 948 Csort = 1188
Theoretic worst-case lower bound is 523 = Math.ceil(N*(Math.log(N)/Math.log(2))- 1.443*N + 2.9)
Theoretic average-case lower bound is 523.6175470723599 = ((N+0.5)*(Math.log(N)/Math.log(2))- 1.45*N + 0.91)
N = 1000
CmakeHeap(1000) = 1982
SumCremove(1000) = 15582
T(1000) = 17564
x = 0.965784284662087
alpha = 1.989784284662087
Calculated worst-case running time is are:
CmakeHeap = 2043 SumCremove = 15955 Csort = 17998
Theoretic worst-case lower bound is 8526 = Math.ceil(N*(Math.log(N)/Math.log(2))- 1.443*N + 2.9)
Theoretic average-case lower bound is 8521.677176804418 = ((N+0.5)*(Math.log(N)/Math.log(2))- 1.45*N + 0.91)
N = 10000
CmakeHeap(10000) = 19982
SumCremove(10000) = 224453
T(10000) = 244435
x = 0.2877123795494505
alpha = 1.9261123795494492
Calculated worst-case running time is are:
CmakeHeap = 26409 SumCremove = 227236 Csort = 253645
Theoretic worst-case lower bound is 118451 = Math.ceil(N*(Math.log(N)/Math.log(2))- 1.443*N + 2.9)
Theoretic average-case lower bound is 118384.6776516843 = ((N+0.5)*(Math.log(N)/Math.log(2))- 1.45*N + 0.91)
N = 100000
CmakeHeap(100000) = 199978
SumCremove(100000) = 2912506
T(100000) = 3112484
x = 0.6096404744368122
alpha = 1.9203604744368117
Calculated worst-case running time is are:
CmakeHeap = 231104 SumCremove = 2937860 Csort = 3168964
Theoretic worst-case lower bound is 1516667 = Math.ceil(N*(Math.log(N)/Math.log(2))- 1.443*N + 2.9)
Theoretic average-case lower bound is 1515973.2622639183 = ((N+0.5)*(Math.log(N)/Math.log(2))- 1.45*N + 0.91)
N = 1000000
CmakeHeap(1000000) = 1999974
SumCremove(1000000) = 35689612
T(1000000) = 37689586
x = 0.931568569324174
alpha = 1.9801445693241742
Calculated worst-case running time is are:
CmakeHeap = 2048615 SumCremove = 35902852 Csort = 37951467
Theoretic worst-case lower bound is 18488572 = Math.ceil(N*(Math.log(N)/Math.log(2))- 1.443*N + 2.9)
Theoretic average-case lower bound is 1.848157944510846E7 = ((N+0.5)*(Math.log(N)/Math.log(2))- 1.45*N + 0.91)
BUILD SUCCESSFUL (total time: 1 second)