Which of the below algorithms it is not possible to follow divide and conquer mechanism
finding power of a number
Finding fibonacci series
You can do power of a number, fibonacci series, and a quick sort algorithm using divide and conquer rule with O(log n) time complexity.
Back To Top