Can anyone explain how you actually arrive with the following recurrence relation for this question?
I know for n<= k it's O(1) since it's just returning the array but how do you get the bottom part?
Can anyone explain how you actually arrive with the following recurrence relation for this question?
I know for n<= k it's O(1) since it's just returning the array but how do you get the bottom part?
Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.
Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!