quizOnBasics

quizOnBasics - Algorithm unknown(int sorted Array A int...

This preview shows page 1. Sign up to view the full content.

A Quiz on some basics 1. Analyze the asymptotic time-complexity of the following algorithm- fragment. for i = n through 1 do for j = 1 through n do for k = 1 through i do begin sum = sum + k; print sum; end; for i = 1 through n do sum = sum + i; 2. What does the following algorithm do? Set up a recurrence equation for it’s time-complexity and solve the recurrence equation.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Algorithm unknown (int sorted Array A, int start, int end, int key) begin if start = = end && A[start] = = key then return start; else begin int mid = floor( (start + end)/2 ); if key < A[mid] then return unknown(A, start, mid, key) else return unknown(A, mid+1, end, key); end; end....
View Full Document

{[ snackBarMessage ]}

What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern