Member Avatar for vienne
vienne 0 Newbie Poster

I'm having problem with the complexity of this algorithm. Can you help me?
what is the usual theta function of this algorithm? and how can I solve them?

Algorithm Que (int array A[], int start, int end)
begin

if (start = = end) then return A[start]
else
	begin

int mid = (start+end)/2;

	if (A[start] < A[mid]}) then
		return Que (A, start, mid)
	else
		return Que (A, mid+1, start);

for i = start through end do
		for j = i through end do
			A[i] = A[j]-10;
	end;
end algorithm
  • 1 Contributor
  • 0 Replies
  • 91 Views
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.