Question
How does ‘divide and conquer’ algorithms work?
Answers
For a function to compute on n inputs the divide and conquer strategy suggests the inputs into a k distinct subsets, 1 An example for this approach is ‘binary search’ algorithm. The time complexity of binary search algorithm is O(log n).   Your Comment




  • Contributors: *,


Search
Can you Answer!!
  • Q What is direct update of infoobject?
  • Q What is cvm ?
  • Q Explain how many levels does flash mx support?
  • Q Describe the construction of a thermopile ?
  • Q What is omniquad bordersecure?
  • Q What is desktop?
  • Q Which is Highest Peak in India?
  • Q How to d2 and d4 restore
  • Q How will I know if a client is connected to a service or not?
  • Q The Highest Lake in India is
  • Q How will you transfer data into a file in application server?