Why is processing a sorted array faster than an unsorted array?

You are the victim of branch prediction fail.

Branch prediction. With a sorted array, the condition datac >= 128 is first false for a streak of values, then becomes true for all later values. That's easy to predict.

With an unsorted array, you pay the branching cost.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.

Related Questions