Step 2.
a) Choose the method(s) to be analyzed or Select All
Read methods 69 -- 43 -- 44 Read methods 69 -- 47 -- 48 Read methods 69 -- 49 -- 50 Read methods 69 -- 51 -- 50 Read methods 69 -- 52 -- 53 Read methods 69 -- 54 -- 53 Read methods 69 -- 55 -- 56 Read methods 69 -- 57 -- 58 Read methods 69 -- 59 -- 58 Read methods 69 -- 60 -- 61 <init>(I)V
createTree(II)Lmemory/jolden/bisort/Value;
bisort(IZ)I
bimerge(IZ)I
swapValRight(Lmemory/jolden/bisort/Value;)V
swapValLeft(Lmemory/jolden/bisort/Value;)V
inOrder()V
mult(II)I
skiprand(II)I
random(I)I

b) Cost Model
Number of instructions
Termination
Memory + Garbage Collector NoneScopedReachabilityLiveness
Number of calls to the method in the class

c) Provide an upper bound to check it? No Yes
e.g. [x]=2*x

d) Compute the asymptotic upper bound? No Normal Lazy

e) Select the user interface Automatic Manual