Types of algorithms.

Question

Among divide & conquer,greedy approach, dynamic programming and backtracking; which algorithm is the most efficient and how?

Answer 1

Please specify details because there are infinite possible algorithms

Answer 2

different algorithms are used for different problems. is there a specific problem you have in mind?

Answer 3

Which algorithm among the above is most efficient for computation?

Answer 4

any code like of factorial etc.

Answer 5

harshit computation of what?

Answer 6

harshit well when it comes to factorial there's an O(1) approach that's purely mathematical, a linear approach and a recursive approach and maybe even some other ones. you have to exactly know which problem you're trying to solve to know what kind of algorithm to apply.