the problems can be solved by divide-and-conquer ides has the following general formula for the running time: T(n)=aT(n/b)+f(n)
give an example algorithm for each of the following cases and solve the corresponding recurrence relation by iteration method and by master theorem .
a=b
a<b
a>b
dema_sami
-2
Newbie Poster
Ezzaral
commented:
No evidence of intelligent thought here - not the slightest hint of effort.
-2
Recommended Answers
Jump to PostYou could start by getting a book from the library and reading about master theorem or by looking it up online. It isn't impossible.
All 3 Replies
BestJewSinceJC
700
Posting Maven
You could start by getting a book from the library and reading about master theorem or by looking it up online. It isn't impossible.
dema_sami
-2
Newbie Poster
i have abook but i cant solve it if u can help ,it is a home work
help me if u can
thanx
mrnutty
761
Senior Poster
i have abook but i cant solve it if u can help ,it is a home work
help me if u can
thanx
Instead of asking random people in the internet, use that money
you spent on school, and ask the professor, the teaching assistance,
tutors, your friends. Hell you'll have a better chance asking random
kids in your class.
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.