Why is it faster to process a sorted array than an unsorted array?

I tested this in C++ and noted that it was much quicker to process a sorted array than an unsorted array, but I don't really understand why?

Status: Open Mar 18, 2013 - 04:55 AM

C++, array

Comments (0) | New Comment

Add New Comment

Do you have the same question? Follow this Question

Answer this question Report it

1answer

Voted Best Answer

sai321

Jul 09, 2013 - 11:31 PM

in a simple way it is possible to find a lost object in an ordered house than in a disordered house in the same way it becomes easy for the system to process a ordered algorithm yhan a disordered one..

Report it

Comments (0) | New Comment

Add New Comment

Answer this question

Share Your Own Experience & Expertise

We look to ensure that every question is answered by the best people with relevant expertise and experience, the best answers include multiple perspectives. Do you have relevant expertise or experience to contribute your answer to any of these commonly asked questions?