I have to create a binary search using pointer for a school assignment. I haven't had much luck getting it to work (please keeping mocking and laughter to a minimum)quote: int Search(int num ...

Use a sorted array if deletions and insertions are not going to happen often (or never). Otherwise a balanced binary search tree is usually more appropriate.

A binary search is an efficient method of searching an ordered list. A binary search works like this: Start by setting the counter to the middle position in the list. If the value held there is a ...