Member Avatar for Creator00

Hello,

I need to write the recursive algorithm of type divide and conquer. The input is integer array S. The output is true if the array is sorted or false if not. Algorithm should divide the array in two halves, then to check the sorting of both halves with the same algorithm and show the result based on this.
Could you please help me to solve this?

  • 2 Contributors
  • 1 Reply
  • 56 Views
  • 6 Hours Discussion Span
  • Latest Post Latest Post by xavier666
Member Avatar for xavier666

Could you please help me to solve this?

Sure we could help you but at least show us what you have come up with so far

commented: Indeed it is so +18
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.