Algorithms Asymptotic Worst Case Time and Time Complexity Introduction

The recurrence equation T(n) = T(n/2) + 1 represents the time complexity of which algorithmic paradigm? 

1
Divide and Conquer
2
Greedy Algorithms 
3
Dynamic Programming 
4
Brute Force

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters