C Binary search array question

Question

1.00/5 (1 vote)

See more:

So i have an array for example 4,3,17,5,1,2
and the output should be: 17-1=16 since it is the max difference between the numbers.
i figured it out how to do it, but what I don't understand is, why my teacher is telling me to sort the array and to apply binary search, it should be O(nlogn). I don't understand what is the difference if i do it linear, just comparing the max diff with every other ones and thats all, why i need to sort it???

Posted 16-Feb-15 9:44am

Member 11456611

Add a Solution

Comments

Richard Deeming 16-Feb-15 16:23pm

The instructions as you've posted them don't make much sense. Sorting the array just to find the min and max would take longer than a linear search, and if you did sort it, you certainly wouldn't need a binary search to find the first and last elements of the array.

However, your teacher is the only person who can answer this question.

Member 11456611 16-Feb-15 16:28pm

i completely agree with you, i could not catch the teacher yet. but i will definitely ask him.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

KarstenK · Answer 1 · 2015-02-16T22:40:00

Solution 1

Sorting algorhitm have different complexitiy. In the wikipedia you find some explanations.

If you have sorted data you can take the first and the last element. And you are done.

Your teachers wants you to learn about it. :-O

Posted 16-Feb-15 22:40pm

KarstenK