* Step 1: Sum WORST_CASE(Omega(n^1),O(n^1))
+ Considered Problem:
- Strict TRS:
activate(X) -> X
activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
activate(n__s(X)) -> s(activate(X))
activate(n__terms(X)) -> terms(activate(X))
add(0(),X) -> X
add(s(X),Y) -> s(add(X,Y))
dbl(0()) -> 0()
dbl(s(X)) -> s(s(dbl(X)))
first(X1,X2) -> n__first(X1,X2)
first(0(),X) -> nil()
first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
half(0()) -> 0()
half(dbl(X)) -> X
half(s(0())) -> 0()
half(s(s(X))) -> s(half(X))
s(X) -> n__s(X)
sqr(0()) -> 0()
sqr(s(X)) -> s(add(sqr(X),dbl(X)))
terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
terms(X) -> n__terms(X)
- Signature:
{activate/1,add/2,dbl/1,first/2,half/1,s/1,sqr/1,terms/1} / {0/0,cons/2,n__first/2,n__s/1,n__terms/1,nil/0
,recip/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {activate,add,dbl,first,half,s,sqr
,terms} and constructors {0,cons,n__first,n__s,n__terms,nil,recip}
+ Applied Processor:
Sum {left = someStrategy, right = someStrategy}
+ Details:
()
** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?)
+ Considered Problem:
- Strict TRS:
activate(X) -> X
activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
activate(n__s(X)) -> s(activate(X))
activate(n__terms(X)) -> terms(activate(X))
add(0(),X) -> X
add(s(X),Y) -> s(add(X,Y))
dbl(0()) -> 0()
dbl(s(X)) -> s(s(dbl(X)))
first(X1,X2) -> n__first(X1,X2)
first(0(),X) -> nil()
first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
half(0()) -> 0()
half(dbl(X)) -> X
half(s(0())) -> 0()
half(s(s(X))) -> s(half(X))
s(X) -> n__s(X)
sqr(0()) -> 0()
sqr(s(X)) -> s(add(sqr(X),dbl(X)))
terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
terms(X) -> n__terms(X)
- Signature:
{activate/1,add/2,dbl/1,first/2,half/1,s/1,sqr/1,terms/1} / {0/0,cons/2,n__first/2,n__s/1,n__terms/1,nil/0
,recip/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {activate,add,dbl,first,half,s,sqr
,terms} and constructors {0,cons,n__first,n__s,n__terms,nil,recip}
+ Applied Processor:
DecreasingLoops {bound = AnyLoop, narrow = 10}
+ Details:
The system has following decreasing Loops:
activate(x){x -> n__first(x,y)} =
activate(n__first(x,y)) ->^+ first(activate(x),activate(y))
= C[activate(x) = activate(x){}]
** Step 1.b:1: InnermostRuleRemoval WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
activate(X) -> X
activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
activate(n__s(X)) -> s(activate(X))
activate(n__terms(X)) -> terms(activate(X))
add(0(),X) -> X
add(s(X),Y) -> s(add(X,Y))
dbl(0()) -> 0()
dbl(s(X)) -> s(s(dbl(X)))
first(X1,X2) -> n__first(X1,X2)
first(0(),X) -> nil()
first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
half(0()) -> 0()
half(dbl(X)) -> X
half(s(0())) -> 0()
half(s(s(X))) -> s(half(X))
s(X) -> n__s(X)
sqr(0()) -> 0()
sqr(s(X)) -> s(add(sqr(X),dbl(X)))
terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
terms(X) -> n__terms(X)
- Signature:
{activate/1,add/2,dbl/1,first/2,half/1,s/1,sqr/1,terms/1} / {0/0,cons/2,n__first/2,n__s/1,n__terms/1,nil/0
,recip/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {activate,add,dbl,first,half,s,sqr
,terms} and constructors {0,cons,n__first,n__s,n__terms,nil,recip}
+ Applied Processor:
InnermostRuleRemoval
+ Details:
Arguments of following rules are not normal-forms.
add(s(X),Y) -> s(add(X,Y))
dbl(s(X)) -> s(s(dbl(X)))
first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
half(s(0())) -> 0()
half(s(s(X))) -> s(half(X))
sqr(s(X)) -> s(add(sqr(X),dbl(X)))
All above mentioned rules can be savely removed.
** Step 1.b:2: MI WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
activate(X) -> X
activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
activate(n__s(X)) -> s(activate(X))
activate(n__terms(X)) -> terms(activate(X))
add(0(),X) -> X
dbl(0()) -> 0()
first(X1,X2) -> n__first(X1,X2)
first(0(),X) -> nil()
half(0()) -> 0()
half(dbl(X)) -> X
s(X) -> n__s(X)
sqr(0()) -> 0()
terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
terms(X) -> n__terms(X)
- Signature:
{activate/1,add/2,dbl/1,first/2,half/1,s/1,sqr/1,terms/1} / {0/0,cons/2,n__first/2,n__s/1,n__terms/1,nil/0
,recip/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {activate,add,dbl,first,half,s,sqr
,terms} and constructors {0,cons,n__first,n__s,n__terms,nil,recip}
+ Applied Processor:
MI {miKind = MaximalMatrix (UpperTriangular (Multiplicity Nothing)), miDimension = 1, miUArgs = UArgs, miURules = URules, miSelector = Just any strict-rules}
+ Details:
We apply a matrix interpretation of kind MaximalMatrix (UpperTriangular (Multiplicity Nothing)):
The following argument positions are considered usable:
uargs(cons) = {1},
uargs(first) = {1,2},
uargs(recip) = {1},
uargs(s) = {1},
uargs(terms) = {1}
Following symbols are considered usable:
{activate,add,dbl,first,half,s,sqr,terms}
TcT has computed the following interpretation:
p(0) = [0]
p(activate) = [1] x_1 + [0]
p(add) = [1] x_1 + [1] x_2 + [5]
p(cons) = [1] x_1 + [2]
p(dbl) = [1] x_1 + [1]
p(first) = [1] x_1 + [1] x_2 + [5]
p(half) = [8] x_1 + [0]
p(n__first) = [1] x_1 + [1] x_2 + [5]
p(n__s) = [1] x_1 + [0]
p(n__terms) = [1] x_1 + [10]
p(nil) = [0]
p(recip) = [1] x_1 + [2]
p(s) = [1] x_1 + [0]
p(sqr) = [4]
p(terms) = [1] x_1 + [10]
Following rules are strictly oriented:
add(0(),X) = [1] X + [5]
> [1] X + [0]
= X
dbl(0()) = [1]
> [0]
= 0()
first(0(),X) = [1] X + [5]
> [0]
= nil()
half(dbl(X)) = [8] X + [8]
> [1] X + [0]
= X
sqr(0()) = [4]
> [0]
= 0()
terms(N) = [1] N + [10]
> [8]
= cons(recip(sqr(N)),n__terms(n__s(N)))
Following rules are (at-least) weakly oriented:
activate(X) = [1] X + [0]
>= [1] X + [0]
= X
activate(n__first(X1,X2)) = [1] X1 + [1] X2 + [5]
>= [1] X1 + [1] X2 + [5]
= first(activate(X1),activate(X2))
activate(n__s(X)) = [1] X + [0]
>= [1] X + [0]
= s(activate(X))
activate(n__terms(X)) = [1] X + [10]
>= [1] X + [10]
= terms(activate(X))
first(X1,X2) = [1] X1 + [1] X2 + [5]
>= [1] X1 + [1] X2 + [5]
= n__first(X1,X2)
half(0()) = [0]
>= [0]
= 0()
s(X) = [1] X + [0]
>= [1] X + [0]
= n__s(X)
terms(X) = [1] X + [10]
>= [1] X + [10]
= n__terms(X)
** Step 1.b:3: WeightGap WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
activate(X) -> X
activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
activate(n__s(X)) -> s(activate(X))
activate(n__terms(X)) -> terms(activate(X))
first(X1,X2) -> n__first(X1,X2)
half(0()) -> 0()
s(X) -> n__s(X)
terms(X) -> n__terms(X)
- Weak TRS:
add(0(),X) -> X
dbl(0()) -> 0()
first(0(),X) -> nil()
half(dbl(X)) -> X
sqr(0()) -> 0()
terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
- Signature:
{activate/1,add/2,dbl/1,first/2,half/1,s/1,sqr/1,terms/1} / {0/0,cons/2,n__first/2,n__s/1,n__terms/1,nil/0
,recip/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {activate,add,dbl,first,half,s,sqr
,terms} and constructors {0,cons,n__first,n__s,n__terms,nil,recip}
+ Applied Processor:
WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = UArgs, wgOn = WgOnAny}
+ Details:
The weightgap principle applies using the following nonconstant growth matrix-interpretation:
We apply a matrix interpretation of kind constructor based matrix interpretation:
The following argument positions are considered usable:
uargs(cons) = {1},
uargs(first) = {1,2},
uargs(recip) = {1},
uargs(s) = {1},
uargs(terms) = {1}
Following symbols are considered usable:
all
TcT has computed the following interpretation:
p(0) = [2]
p(activate) = [4] x1 + [11]
p(add) = [2] x2 + [13]
p(cons) = [1] x1 + [0]
p(dbl) = [3] x1 + [1]
p(first) = [1] x1 + [1] x2 + [2]
p(half) = [8] x1 + [7]
p(n__first) = [1] x1 + [1] x2 + [0]
p(n__s) = [1] x1 + [5]
p(n__terms) = [1] x1 + [0]
p(nil) = [4]
p(recip) = [1] x1 + [2]
p(s) = [1] x1 + [5]
p(sqr) = [9]
p(terms) = [1] x1 + [11]
Following rules are strictly oriented:
activate(X) = [4] X + [11]
> [1] X + [0]
= X
activate(n__s(X)) = [4] X + [31]
> [4] X + [16]
= s(activate(X))
first(X1,X2) = [1] X1 + [1] X2 + [2]
> [1] X1 + [1] X2 + [0]
= n__first(X1,X2)
half(0()) = [23]
> [2]
= 0()
terms(X) = [1] X + [11]
> [1] X + [0]
= n__terms(X)
Following rules are (at-least) weakly oriented:
activate(n__first(X1,X2)) = [4] X1 + [4] X2 + [11]
>= [4] X1 + [4] X2 + [24]
= first(activate(X1),activate(X2))
activate(n__terms(X)) = [4] X + [11]
>= [4] X + [22]
= terms(activate(X))
add(0(),X) = [2] X + [13]
>= [1] X + [0]
= X
dbl(0()) = [7]
>= [2]
= 0()
first(0(),X) = [1] X + [4]
>= [4]
= nil()
half(dbl(X)) = [24] X + [15]
>= [1] X + [0]
= X
s(X) = [1] X + [5]
>= [1] X + [5]
= n__s(X)
sqr(0()) = [9]
>= [2]
= 0()
terms(N) = [1] N + [11]
>= [11]
= cons(recip(sqr(N)),n__terms(n__s(N)))
Further, it can be verified that all rules not oriented are covered by the weightgap condition.
** Step 1.b:4: WeightGap WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
activate(n__terms(X)) -> terms(activate(X))
s(X) -> n__s(X)
- Weak TRS:
activate(X) -> X
activate(n__s(X)) -> s(activate(X))
add(0(),X) -> X
dbl(0()) -> 0()
first(X1,X2) -> n__first(X1,X2)
first(0(),X) -> nil()
half(0()) -> 0()
half(dbl(X)) -> X
sqr(0()) -> 0()
terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
terms(X) -> n__terms(X)
- Signature:
{activate/1,add/2,dbl/1,first/2,half/1,s/1,sqr/1,terms/1} / {0/0,cons/2,n__first/2,n__s/1,n__terms/1,nil/0
,recip/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {activate,add,dbl,first,half,s,sqr
,terms} and constructors {0,cons,n__first,n__s,n__terms,nil,recip}
+ Applied Processor:
WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = UArgs, wgOn = WgOnAny}
+ Details:
The weightgap principle applies using the following nonconstant growth matrix-interpretation:
We apply a matrix interpretation of kind constructor based matrix interpretation:
The following argument positions are considered usable:
uargs(cons) = {1},
uargs(first) = {1,2},
uargs(recip) = {1},
uargs(s) = {1},
uargs(terms) = {1}
Following symbols are considered usable:
all
TcT has computed the following interpretation:
p(0) = [2]
p(activate) = [11] x1 + [0]
p(add) = [2] x2 + [0]
p(cons) = [1] x1 + [0]
p(dbl) = [1] x1 + [0]
p(first) = [1] x1 + [1] x2 + [0]
p(half) = [1] x1 + [0]
p(n__first) = [1] x1 + [1] x2 + [0]
p(n__s) = [1] x1 + [1]
p(n__terms) = [1] x1 + [0]
p(nil) = [2]
p(recip) = [1] x1 + [0]
p(s) = [1] x1 + [11]
p(sqr) = [1] x1 + [0]
p(terms) = [1] x1 + [0]
Following rules are strictly oriented:
s(X) = [1] X + [11]
> [1] X + [1]
= n__s(X)
Following rules are (at-least) weakly oriented:
activate(X) = [11] X + [0]
>= [1] X + [0]
= X
activate(n__first(X1,X2)) = [11] X1 + [11] X2 + [0]
>= [11] X1 + [11] X2 + [0]
= first(activate(X1),activate(X2))
activate(n__s(X)) = [11] X + [11]
>= [11] X + [11]
= s(activate(X))
activate(n__terms(X)) = [11] X + [0]
>= [11] X + [0]
= terms(activate(X))
add(0(),X) = [2] X + [0]
>= [1] X + [0]
= X
dbl(0()) = [2]
>= [2]
= 0()
first(X1,X2) = [1] X1 + [1] X2 + [0]
>= [1] X1 + [1] X2 + [0]
= n__first(X1,X2)
first(0(),X) = [1] X + [2]
>= [2]
= nil()
half(0()) = [2]
>= [2]
= 0()
half(dbl(X)) = [1] X + [0]
>= [1] X + [0]
= X
sqr(0()) = [2]
>= [2]
= 0()
terms(N) = [1] N + [0]
>= [1] N + [0]
= cons(recip(sqr(N)),n__terms(n__s(N)))
terms(X) = [1] X + [0]
>= [1] X + [0]
= n__terms(X)
Further, it can be verified that all rules not oriented are covered by the weightgap condition.
** Step 1.b:5: WeightGap WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
activate(n__terms(X)) -> terms(activate(X))
- Weak TRS:
activate(X) -> X
activate(n__s(X)) -> s(activate(X))
add(0(),X) -> X
dbl(0()) -> 0()
first(X1,X2) -> n__first(X1,X2)
first(0(),X) -> nil()
half(0()) -> 0()
half(dbl(X)) -> X
s(X) -> n__s(X)
sqr(0()) -> 0()
terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
terms(X) -> n__terms(X)
- Signature:
{activate/1,add/2,dbl/1,first/2,half/1,s/1,sqr/1,terms/1} / {0/0,cons/2,n__first/2,n__s/1,n__terms/1,nil/0
,recip/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {activate,add,dbl,first,half,s,sqr
,terms} and constructors {0,cons,n__first,n__s,n__terms,nil,recip}
+ Applied Processor:
WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = UArgs, wgOn = WgOnAny}
+ Details:
The weightgap principle applies using the following nonconstant growth matrix-interpretation:
We apply a matrix interpretation of kind constructor based matrix interpretation:
The following argument positions are considered usable:
uargs(cons) = {1},
uargs(first) = {1,2},
uargs(recip) = {1},
uargs(s) = {1},
uargs(terms) = {1}
Following symbols are considered usable:
all
TcT has computed the following interpretation:
p(0) = [2]
p(activate) = [4] x1 + [3]
p(add) = [2] x2 + [0]
p(cons) = [1] x1 + [1]
p(dbl) = [2] x1 + [11]
p(first) = [1] x1 + [1] x2 + [14]
p(half) = [1] x1 + [0]
p(n__first) = [1] x1 + [1] x2 + [5]
p(n__s) = [1] x1 + [0]
p(n__terms) = [1] x1 + [2]
p(nil) = [0]
p(recip) = [1] x1 + [2]
p(s) = [1] x1 + [0]
p(sqr) = [6]
p(terms) = [1] x1 + [11]
Following rules are strictly oriented:
activate(n__first(X1,X2)) = [4] X1 + [4] X2 + [23]
> [4] X1 + [4] X2 + [20]
= first(activate(X1),activate(X2))
Following rules are (at-least) weakly oriented:
activate(X) = [4] X + [3]
>= [1] X + [0]
= X
activate(n__s(X)) = [4] X + [3]
>= [4] X + [3]
= s(activate(X))
activate(n__terms(X)) = [4] X + [11]
>= [4] X + [14]
= terms(activate(X))
add(0(),X) = [2] X + [0]
>= [1] X + [0]
= X
dbl(0()) = [15]
>= [2]
= 0()
first(X1,X2) = [1] X1 + [1] X2 + [14]
>= [1] X1 + [1] X2 + [5]
= n__first(X1,X2)
first(0(),X) = [1] X + [16]
>= [0]
= nil()
half(0()) = [2]
>= [2]
= 0()
half(dbl(X)) = [2] X + [11]
>= [1] X + [0]
= X
s(X) = [1] X + [0]
>= [1] X + [0]
= n__s(X)
sqr(0()) = [6]
>= [2]
= 0()
terms(N) = [1] N + [11]
>= [9]
= cons(recip(sqr(N)),n__terms(n__s(N)))
terms(X) = [1] X + [11]
>= [1] X + [2]
= n__terms(X)
Further, it can be verified that all rules not oriented are covered by the weightgap condition.
** Step 1.b:6: WeightGap WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
activate(n__terms(X)) -> terms(activate(X))
- Weak TRS:
activate(X) -> X
activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
activate(n__s(X)) -> s(activate(X))
add(0(),X) -> X
dbl(0()) -> 0()
first(X1,X2) -> n__first(X1,X2)
first(0(),X) -> nil()
half(0()) -> 0()
half(dbl(X)) -> X
s(X) -> n__s(X)
sqr(0()) -> 0()
terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
terms(X) -> n__terms(X)
- Signature:
{activate/1,add/2,dbl/1,first/2,half/1,s/1,sqr/1,terms/1} / {0/0,cons/2,n__first/2,n__s/1,n__terms/1,nil/0
,recip/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {activate,add,dbl,first,half,s,sqr
,terms} and constructors {0,cons,n__first,n__s,n__terms,nil,recip}
+ Applied Processor:
WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = UArgs, wgOn = WgOnAny}
+ Details:
The weightgap principle applies using the following nonconstant growth matrix-interpretation:
We apply a matrix interpretation of kind constructor based matrix interpretation:
The following argument positions are considered usable:
uargs(cons) = {1},
uargs(first) = {1,2},
uargs(recip) = {1},
uargs(s) = {1},
uargs(terms) = {1}
Following symbols are considered usable:
all
TcT has computed the following interpretation:
p(0) = [0]
p(activate) = [2] x1 + [0]
p(add) = [1] x1 + [4] x2 + [0]
p(cons) = [1] x1 + [4]
p(dbl) = [1] x1 + [0]
p(first) = [1] x1 + [1] x2 + [0]
p(half) = [4] x1 + [2]
p(n__first) = [1] x1 + [1] x2 + [0]
p(n__s) = [1] x1 + [2]
p(n__terms) = [1] x1 + [8]
p(nil) = [0]
p(recip) = [1] x1 + [1]
p(s) = [1] x1 + [4]
p(sqr) = [3]
p(terms) = [1] x1 + [8]
Following rules are strictly oriented:
activate(n__terms(X)) = [2] X + [16]
> [2] X + [8]
= terms(activate(X))
Following rules are (at-least) weakly oriented:
activate(X) = [2] X + [0]
>= [1] X + [0]
= X
activate(n__first(X1,X2)) = [2] X1 + [2] X2 + [0]
>= [2] X1 + [2] X2 + [0]
= first(activate(X1),activate(X2))
activate(n__s(X)) = [2] X + [4]
>= [2] X + [4]
= s(activate(X))
add(0(),X) = [4] X + [0]
>= [1] X + [0]
= X
dbl(0()) = [0]
>= [0]
= 0()
first(X1,X2) = [1] X1 + [1] X2 + [0]
>= [1] X1 + [1] X2 + [0]
= n__first(X1,X2)
first(0(),X) = [1] X + [0]
>= [0]
= nil()
half(0()) = [2]
>= [0]
= 0()
half(dbl(X)) = [4] X + [2]
>= [1] X + [0]
= X
s(X) = [1] X + [4]
>= [1] X + [2]
= n__s(X)
sqr(0()) = [3]
>= [0]
= 0()
terms(N) = [1] N + [8]
>= [8]
= cons(recip(sqr(N)),n__terms(n__s(N)))
terms(X) = [1] X + [8]
>= [1] X + [8]
= n__terms(X)
Further, it can be verified that all rules not oriented are covered by the weightgap condition.
** Step 1.b:7: EmptyProcessor WORST_CASE(?,O(1))
+ Considered Problem:
- Weak TRS:
activate(X) -> X
activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
activate(n__s(X)) -> s(activate(X))
activate(n__terms(X)) -> terms(activate(X))
add(0(),X) -> X
dbl(0()) -> 0()
first(X1,X2) -> n__first(X1,X2)
first(0(),X) -> nil()
half(0()) -> 0()
half(dbl(X)) -> X
s(X) -> n__s(X)
sqr(0()) -> 0()
terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N)))
terms(X) -> n__terms(X)
- Signature:
{activate/1,add/2,dbl/1,first/2,half/1,s/1,sqr/1,terms/1} / {0/0,cons/2,n__first/2,n__s/1,n__terms/1,nil/0
,recip/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {activate,add,dbl,first,half,s,sqr
,terms} and constructors {0,cons,n__first,n__s,n__terms,nil,recip}
+ Applied Processor:
EmptyProcessor
+ Details:
The problem is already closed. The intended complexity is O(1).
WORST_CASE(Omega(n^1),O(n^1))