9.08/4.82	WORST_CASE(Omega(n^1), O(n^2))
9.08/4.83	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
9.08/4.83	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.08/4.83	
9.08/4.83	
9.08/4.83	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, max(4, -2 + 3 * Arg_0) * nat(Arg_0) + max(4, -2 + 3 * Arg_0) * nat(Arg_0)^2 + max(2, -2 + 2 * Arg_0) + nat(-1 + Arg_0) + max(-6 + 6 * Arg_0, 6) + max(7 + 3 * Arg_0, 13)).
9.08/4.83	
9.08/4.83	(0) CpxIntTrs
9.08/4.83	(1) Loat Proof [FINISHED, 1617 ms]
9.08/4.83	(2) BOUNDS(n^1, INF)
9.08/4.83	
9.08/4.83	
9.08/4.83	----------------------------------------
9.08/4.83	
9.08/4.83	(0)
9.08/4.83	Obligation:
9.08/4.83	Complexity Int TRS consisting of the following rules:
9.08/4.83	evalperfectstart(A, B, C, D) -> Com_1(evalperfectentryin(A, B, C, D)) :|: TRUE
9.08/4.83	evalperfectentryin(A, B, C, D) -> Com_1(evalperfectreturnin(A, B, C, D)) :|: 1 >= A
9.08/4.83	evalperfectentryin(A, B, C, D) -> Com_1(evalperfectbb1in(A, B, C, D)) :|: A >= 2
9.08/4.83	evalperfectbb1in(A, B, C, D) -> Com_1(evalperfectbb8in(A, A, A - 1, D)) :|: TRUE
9.08/4.83	evalperfectbb8in(A, B, C, D) -> Com_1(evalperfectbb4in(A, B, C, A)) :|: C >= 1
9.08/4.83	evalperfectbb8in(A, B, C, D) -> Com_1(evalperfectbb9in(B, B, C, D)) :|: 0 >= C
9.08/4.83	evalperfectbb4in(A, B, C, D) -> Com_1(evalperfectbb3in(A, B, C, D)) :|: D >= C
9.08/4.83	evalperfectbb4in(A, B, C, D) -> Com_1(evalperfectbb5in(A, B, C, D)) :|: C >= D + 1
9.08/4.83	evalperfectbb3in(A, B, C, D) -> Com_1(evalperfectbb4in(A, B, C, D - C)) :|: TRUE
9.08/4.83	evalperfectbb5in(A, B, C, D) -> Com_1(evalperfectbb8in(A, B - C, C - 1, D)) :|: D >= 0 && D <= 0
9.08/4.83	evalperfectbb5in(A, B, C, D) -> Com_1(evalperfectbb8in(A, B, C - 1, D)) :|: 0 >= D + 1
9.08/4.83	evalperfectbb5in(A, B, C, D) -> Com_1(evalperfectbb8in(A, B, C - 1, D)) :|: D >= 1
9.08/4.83	evalperfectbb9in(A, B, C, D) -> Com_1(evalperfectreturnin(A, B, C, D)) :|: 0 >= A + 1
9.08/4.83	evalperfectbb9in(A, B, C, D) -> Com_1(evalperfectreturnin(A, B, C, D)) :|: A >= 1
9.08/4.83	evalperfectbb9in(A, B, C, D) -> Com_1(evalperfectreturnin(A, B, C, D)) :|: A >= 0 && A <= 0
9.08/4.83	evalperfectreturnin(A, B, C, D) -> Com_1(evalperfectstop(A, B, C, D)) :|: TRUE
9.08/4.83	
9.08/4.83	The start-symbols are:[evalperfectstart_4]
9.08/4.83	
9.08/4.83	
9.08/4.83	----------------------------------------
9.08/4.83	
9.08/4.83	(1) Loat Proof (FINISHED)
9.08/4.83	
9.08/4.83	
9.08/4.83	### Pre-processing the ITS problem ###
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Initial linear ITS problem
9.08/4.83	
9.08/4.83	   Start location: evalperfectstart
9.08/4.83	
9.08/4.83	      0: evalperfectstart -> evalperfectentryin : [], cost: 1
9.08/4.83	
9.08/4.83	      1: evalperfectentryin -> evalperfectreturnin : [ 1>=A ], cost: 1
9.08/4.83	
9.08/4.83	      2: evalperfectentryin -> evalperfectbb1in : [ A>=2 ], cost: 1
9.08/4.83	
9.08/4.83	      3: evalperfectbb1in -> evalperfectbb8in : B'=A, C'=-1+A, [], cost: 1
9.08/4.83	
9.08/4.83	      4: evalperfectbb8in -> evalperfectbb4in : D'=A, [ C>=1 ], cost: 1
9.08/4.83	
9.08/4.83	      5: evalperfectbb8in -> evalperfectbb9in : A'=B, [ 0>=C ], cost: 1
9.08/4.83	
9.08/4.83	      6: evalperfectbb4in -> evalperfectbb3in : [ D>=C ], cost: 1
9.08/4.83	
9.08/4.83	      7: evalperfectbb4in -> evalperfectbb5in : [ C>=1+D ], cost: 1
9.08/4.83	
9.08/4.83	      8: evalperfectbb3in -> evalperfectbb4in : D'=-C+D, [], cost: 1
9.08/4.83	
9.08/4.83	      9: evalperfectbb5in -> evalperfectbb8in : B'=-C+B, C'=-1+C, [ D==0 ], cost: 1
9.08/4.83	
9.08/4.83	     10: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ 0>=1+D ], cost: 1
9.08/4.83	
9.08/4.83	     11: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ D>=1 ], cost: 1
9.08/4.83	
9.08/4.83	     12: evalperfectbb9in -> evalperfectreturnin : [ 0>=1+A ], cost: 1
9.08/4.83	
9.08/4.83	     13: evalperfectbb9in -> evalperfectreturnin : [ A>=1 ], cost: 1
9.08/4.83	
9.08/4.83	     14: evalperfectbb9in -> evalperfectreturnin : [ A==0 ], cost: 1
9.08/4.83	
9.08/4.83	     15: evalperfectreturnin -> evalperfectstop : [], cost: 1
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Removed unreachable and leaf rules:
9.08/4.83	
9.08/4.83	   Start location: evalperfectstart
9.08/4.83	
9.08/4.83	      0: evalperfectstart -> evalperfectentryin : [], cost: 1
9.08/4.83	
9.08/4.83	      2: evalperfectentryin -> evalperfectbb1in : [ A>=2 ], cost: 1
9.08/4.83	
9.08/4.83	      3: evalperfectbb1in -> evalperfectbb8in : B'=A, C'=-1+A, [], cost: 1
9.08/4.83	
9.08/4.83	      4: evalperfectbb8in -> evalperfectbb4in : D'=A, [ C>=1 ], cost: 1
9.08/4.83	
9.08/4.83	      6: evalperfectbb4in -> evalperfectbb3in : [ D>=C ], cost: 1
9.08/4.83	
9.08/4.83	      7: evalperfectbb4in -> evalperfectbb5in : [ C>=1+D ], cost: 1
9.08/4.83	
9.08/4.83	      8: evalperfectbb3in -> evalperfectbb4in : D'=-C+D, [], cost: 1
9.08/4.83	
9.08/4.83	      9: evalperfectbb5in -> evalperfectbb8in : B'=-C+B, C'=-1+C, [ D==0 ], cost: 1
9.08/4.83	
9.08/4.83	     10: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ 0>=1+D ], cost: 1
9.08/4.83	
9.08/4.83	     11: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ D>=1 ], cost: 1
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	### Simplification by acceleration and chaining ###
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Eliminated locations (on linear paths):
9.08/4.83	
9.08/4.83	   Start location: evalperfectstart
9.08/4.83	
9.08/4.83	     17: evalperfectstart -> evalperfectbb8in : B'=A, C'=-1+A, [ A>=2 ], cost: 3
9.08/4.83	
9.08/4.83	      4: evalperfectbb8in -> evalperfectbb4in : D'=A, [ C>=1 ], cost: 1
9.08/4.83	
9.08/4.83	      7: evalperfectbb4in -> evalperfectbb5in : [ C>=1+D ], cost: 1
9.08/4.83	
9.08/4.83	     18: evalperfectbb4in -> evalperfectbb4in : D'=-C+D, [ D>=C ], cost: 2
9.08/4.83	
9.08/4.83	      9: evalperfectbb5in -> evalperfectbb8in : B'=-C+B, C'=-1+C, [ D==0 ], cost: 1
9.08/4.83	
9.08/4.83	     10: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ 0>=1+D ], cost: 1
9.08/4.83	
9.08/4.83	     11: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ D>=1 ], cost: 1
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Accelerating simple loops of location 4.
9.08/4.83	
9.08/4.83	   Accelerating the following rules:
9.08/4.83	
9.08/4.83	     18: evalperfectbb4in -> evalperfectbb4in : D'=-C+D, [ D>=C ], cost: 2
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	   Found no metering function for rule 18.
9.08/4.83	
9.08/4.83	   Removing the simple loops:.
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Accelerated all simple loops using metering functions (where possible):
9.08/4.83	
9.08/4.83	   Start location: evalperfectstart
9.08/4.83	
9.08/4.83	     17: evalperfectstart -> evalperfectbb8in : B'=A, C'=-1+A, [ A>=2 ], cost: 3
9.08/4.83	
9.08/4.83	      4: evalperfectbb8in -> evalperfectbb4in : D'=A, [ C>=1 ], cost: 1
9.08/4.83	
9.08/4.83	      7: evalperfectbb4in -> evalperfectbb5in : [ C>=1+D ], cost: 1
9.08/4.83	
9.08/4.83	     18: evalperfectbb4in -> evalperfectbb4in : D'=-C+D, [ D>=C ], cost: 2
9.08/4.83	
9.08/4.83	      9: evalperfectbb5in -> evalperfectbb8in : B'=-C+B, C'=-1+C, [ D==0 ], cost: 1
9.08/4.83	
9.08/4.83	     10: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ 0>=1+D ], cost: 1
9.08/4.83	
9.08/4.83	     11: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ D>=1 ], cost: 1
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Chained accelerated rules (with incoming rules):
9.08/4.83	
9.08/4.83	   Start location: evalperfectstart
9.08/4.83	
9.08/4.83	     17: evalperfectstart -> evalperfectbb8in : B'=A, C'=-1+A, [ A>=2 ], cost: 3
9.08/4.83	
9.08/4.83	      4: evalperfectbb8in -> evalperfectbb4in : D'=A, [ C>=1 ], cost: 1
9.08/4.83	
9.08/4.83	     19: evalperfectbb8in -> evalperfectbb4in : D'=-C+A, [ C>=1 && A>=C ], cost: 3
9.08/4.83	
9.08/4.83	      7: evalperfectbb4in -> evalperfectbb5in : [ C>=1+D ], cost: 1
9.08/4.83	
9.08/4.83	      9: evalperfectbb5in -> evalperfectbb8in : B'=-C+B, C'=-1+C, [ D==0 ], cost: 1
9.08/4.83	
9.08/4.83	     10: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ 0>=1+D ], cost: 1
9.08/4.83	
9.08/4.83	     11: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ D>=1 ], cost: 1
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Eliminated locations (on tree-shaped paths):
9.08/4.83	
9.08/4.83	   Start location: evalperfectstart
9.08/4.83	
9.08/4.83	     17: evalperfectstart -> evalperfectbb8in : B'=A, C'=-1+A, [ A>=2 ], cost: 3
9.08/4.83	
9.08/4.83	     20: evalperfectbb8in -> evalperfectbb5in : D'=A, [ C>=1 && C>=1+A ], cost: 2
9.08/4.83	
9.08/4.83	     21: evalperfectbb8in -> evalperfectbb5in : D'=-C+A, [ C>=1 && A>=C && C>=1-C+A ], cost: 4
9.08/4.83	
9.08/4.83	      9: evalperfectbb5in -> evalperfectbb8in : B'=-C+B, C'=-1+C, [ D==0 ], cost: 1
9.08/4.83	
9.08/4.83	     10: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ 0>=1+D ], cost: 1
9.08/4.83	
9.08/4.83	     11: evalperfectbb5in -> evalperfectbb8in : C'=-1+C, [ D>=1 ], cost: 1
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Eliminated locations (on tree-shaped paths):
9.08/4.83	
9.08/4.83	   Start location: evalperfectstart
9.08/4.83	
9.08/4.83	     17: evalperfectstart -> evalperfectbb8in : B'=A, C'=-1+A, [ A>=2 ], cost: 3
9.08/4.83	
9.08/4.83	     22: evalperfectbb8in -> evalperfectbb8in : B'=-C+B, C'=-1+C, D'=A, [ C>=1 && C>=1+A && A==0 ], cost: 3
9.08/4.83	
9.08/4.83	     23: evalperfectbb8in -> evalperfectbb8in : C'=-1+C, D'=A, [ C>=1 && C>=1+A && 0>=1+A ], cost: 3
9.08/4.83	
9.08/4.83	     24: evalperfectbb8in -> evalperfectbb8in : C'=-1+C, D'=A, [ C>=1 && C>=1+A && A>=1 ], cost: 3
9.08/4.83	
9.08/4.83	     25: evalperfectbb8in -> evalperfectbb8in : B'=-C+B, C'=-1+C, D'=-C+A, [ C>=1 && C>=1-C+A && -C+A==0 ], cost: 5
9.08/4.83	
9.08/4.83	     26: evalperfectbb8in -> evalperfectbb8in : C'=-1+C, D'=-C+A, [ C>=1 && C>=1-C+A && -C+A>=1 ], cost: 5
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Accelerating simple loops of location 3.
9.08/4.83	
9.08/4.83	   Accelerating the following rules:
9.08/4.83	
9.08/4.83	     22: evalperfectbb8in -> evalperfectbb8in : B'=-C+B, C'=-1+C, D'=A, [ C>=1 && C>=1+A && A==0 ], cost: 3
9.08/4.83	
9.08/4.83	     23: evalperfectbb8in -> evalperfectbb8in : C'=-1+C, D'=A, [ C>=1 && C>=1+A && 0>=1+A ], cost: 3
9.08/4.83	
9.08/4.83	     24: evalperfectbb8in -> evalperfectbb8in : C'=-1+C, D'=A, [ C>=1 && C>=1+A && A>=1 ], cost: 3
9.08/4.83	
9.08/4.83	     25: evalperfectbb8in -> evalperfectbb8in : B'=-C+B, C'=-1+C, D'=-C+A, [ C>=1 && C>=1-C+A && -C+A==0 ], cost: 5
9.08/4.83	
9.08/4.83	     26: evalperfectbb8in -> evalperfectbb8in : C'=-1+C, D'=-C+A, [ C>=1 && C>=1-C+A && -C+A>=1 ], cost: 5
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	   Accelerated rule 22 with metering function C-A, yielding the new rule 27.
9.08/4.83	
9.08/4.83	   Accelerated rule 23 with metering function C, yielding the new rule 28.
9.08/4.83	
9.08/4.83	   Accelerated rule 24 with metering function C-A, yielding the new rule 29.
9.08/4.83	
9.08/4.83	   Accelerated rule 25 with metering function C-A, yielding the new rule 30.
9.08/4.83	
9.08/4.83	   Accelerated rule 26 with metering function meter (where 2*meter==2*C-A), yielding the new rule 31.
9.08/4.83	
9.08/4.83	      During metering: Instantiating temporary variables by {meter==1}
9.08/4.83	
9.08/4.83	   Removing the simple loops: 22 23 24 25 26.
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Accelerated all simple loops using metering functions (where possible):
9.08/4.83	
9.08/4.83	   Start location: evalperfectstart
9.08/4.83	
9.08/4.83	     17: evalperfectstart -> evalperfectbb8in : B'=A, C'=-1+A, [ A>=2 ], cost: 3
9.08/4.83	
9.08/4.83	     27: evalperfectbb8in -> evalperfectbb8in : B'=-1-C*(C-A)+1/2*(C-A)^2+1/2*C-1/2*A+B, C'=A, D'=A, [ C>=1 && C>=1+A && A==0 ], cost: 3*C-3*A
9.08/4.83	
9.08/4.83	     28: evalperfectbb8in -> evalperfectbb8in : C'=0, D'=A, [ C>=1 && C>=1+A && 0>=1+A ], cost: 3*C
9.08/4.83	
9.08/4.83	     29: evalperfectbb8in -> evalperfectbb8in : C'=A, D'=A, [ C>=1 && C>=1+A && A>=1 ], cost: 3*C-3*A
9.08/4.83	
9.08/4.83	     30: evalperfectbb8in -> evalperfectbb8in : B'=-1-C*(C-A)+1/2*(C-A)^2+1/2*C-1/2*A+B, C'=A, D'=-1, [ C>=1 && C>=1-C+A && -C+A==0 && C-A>=1 ], cost: 5*C-5*A
9.08/4.83	
9.08/4.83	     31: evalperfectbb8in -> evalperfectbb8in : C'=C-meter, D'=-1-C+A+meter, [ C>=1 && C>=1-C+A && -C+A>=1 && 2*meter==2*C-A && meter>=1 ], cost: 5*meter
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Chained accelerated rules (with incoming rules):
9.08/4.83	
9.08/4.83	   Start location: evalperfectstart
9.08/4.83	
9.08/4.83	     17: evalperfectstart -> evalperfectbb8in : B'=A, C'=-1+A, [ A>=2 ], cost: 3
9.08/4.83	
9.08/4.83	     32: evalperfectstart -> evalperfectbb8in : B'=A, C'=-1+A-meter, D'=meter, [ -1+A>=2 && 2*meter==-2+A && meter>=1 ], cost: 3+5*meter
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Removed unreachable locations (and leaf rules with constant cost):
9.08/4.83	
9.08/4.83	   Start location: evalperfectstart
9.08/4.83	
9.08/4.83	     32: evalperfectstart -> evalperfectbb8in : B'=A, C'=-1+A-meter, D'=meter, [ -1+A>=2 && 2*meter==-2+A && meter>=1 ], cost: 3+5*meter
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	### Computing asymptotic complexity ###
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Fully simplified ITS problem
9.08/4.83	
9.08/4.83	   Start location: evalperfectstart
9.08/4.83	
9.08/4.83	     32: evalperfectstart -> evalperfectbb8in : B'=A, C'=-1+A-meter, D'=meter, [ -1+A>=2 && 2*meter==-2+A && meter>=1 ], cost: 3+5*meter
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Computing asymptotic complexity for rule 32
9.08/4.83	
9.08/4.83	   Solved the limit problem by the following transformations:
9.08/4.83	
9.08/4.83	      Created initial limit problem:
9.08/4.83	
9.08/4.83	      3-A+2*meter (+/+!), 3+5*meter (+), -1+A-2*meter (+/+!), -2+A (+/+!) [not solved]
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	      applying transformation rule (C) using substitution {A==2+2*meter}
9.08/4.83	
9.08/4.83	      resulting limit problem:
9.08/4.83	
9.08/4.83	      1 (+/+!), 3+5*meter (+), 2*meter (+/+!) [not solved]
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	      applying transformation rule (B), deleting 1 (+/+!)
9.08/4.83	
9.08/4.83	      resulting limit problem:
9.08/4.83	
9.08/4.83	      3+5*meter (+), 2*meter (+/+!) [not solved]
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	      removing all constraints (solved by SMT)
9.08/4.83	
9.08/4.83	      resulting limit problem: [solved]
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	      applying transformation rule (C) using substitution {meter==n}
9.08/4.83	
9.08/4.83	      resulting limit problem:
9.08/4.83	
9.08/4.83	      [solved]
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	   Solved the limit problem by the following transformations:
9.08/4.83	
9.08/4.83	      Created initial limit problem:
9.08/4.83	
9.08/4.83	      3-A+2*meter (+/+!), 3+5*meter (+), -1+A-2*meter (+/+!), -2+A (+/+!) [not solved]
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	      applying transformation rule (C) using substitution {A==2+2*meter}
9.08/4.83	
9.08/4.83	      resulting limit problem:
9.08/4.83	
9.08/4.83	      1 (+/+!), 3+5*meter (+), 2*meter (+/+!) [not solved]
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	      applying transformation rule (B), deleting 1 (+/+!)
9.08/4.83	
9.08/4.83	      resulting limit problem:
9.08/4.83	
9.08/4.83	      3+5*meter (+), 2*meter (+/+!) [not solved]
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	      removing all constraints (solved by SMT)
9.08/4.83	
9.08/4.83	      resulting limit problem: [solved]
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	      applying transformation rule (C) using substitution {meter==n}
9.08/4.83	
9.08/4.83	      resulting limit problem:
9.08/4.83	
9.08/4.83	      [solved]
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	   Solution:
9.08/4.83	
9.08/4.83	      A / 2+2*n
9.08/4.83	
9.08/4.83	      meter / n
9.08/4.83	
9.08/4.83	   Resulting cost 3+5*n has complexity: Poly(n^1)
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Found new complexity Poly(n^1).
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	Obtained the following overall complexity (w.r.t. the length of the input n):
9.08/4.83	
9.08/4.83	   Complexity:  Poly(n^1)
9.08/4.83	
9.08/4.83	   Cpx degree:  1
9.08/4.83	
9.08/4.83	   Solved cost: 3+5*n
9.08/4.83	
9.08/4.83	   Rule cost:   3+5*meter
9.08/4.83	
9.08/4.83	   Rule guard:  [ -1+A>=2 && 2*meter==-2+A ]
9.08/4.83	
9.08/4.83	
9.08/4.83	
9.08/4.83	WORST_CASE(Omega(n^1),?)
9.08/4.83	
9.08/4.83	
9.08/4.83	----------------------------------------
9.08/4.83	
9.08/4.83	(2)
9.08/4.83	BOUNDS(n^1, INF)
9.08/4.86	EOF