The Gateway to Computer Science Excellence
0 votes
76 views

Give a brief argument that the running time of PARTITION on a subarray of size $n$ is $\Theta(n)$.

in Algorithms by | 76 views

1 Answer

0 votes
The for loop will run for $r-p$  times for $A[p....r]$

The other parts of algorithm will be simply $O(1)$ time i.e. constant.

Now since $r-p$ is the size of subarray/array so PARTITION will take time which is at most proportional to the size of subarray/array.

Therefore taking linear time $\Theta (n)$
by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,345 questions
60,517 answers
201,937 comments
95,368 users