1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Softa [21]
3 years ago
5

In order to do a binary search on an array Group of answer choices you must first do a sequential search to be sure the element

you are looking for is there. the array must first be sorted. the values of the array must be numeric. All of these are true
Computers and Technology
1 answer:
Arisa [49]3 years ago
5 0

Answer:

the array must first be sorted.

Explanation:

Binary search is an efficient algorithm used to find an item from a sorted list of items by using the run-time complexity of Ο(log n), where n is total number of elements.

Binary search applies the principles of divide and conquer.

In order to do a binary search on an array, the array must first be sorted in an ascending order.

You might be interested in
Assume you're using a three button mouse. to access shortcut menus, you would
Likurg_2 [28]
<span>Normally you would click the right hand/secondary mouse button but you may configure any of the buttons to work within the Keyboard and Mouse section of System Preferences.
Hope this helps:)</span>
6 0
3 years ago
Read 2 more answers
I have a computer teacher who made me lose points in an assignment and saying that the reference page should be on a separate pa
lukranit [14]

Answer:

Have a talk with your teacher. Ask why she doesn't believe you, and if it still doesn't work, have a talk with someone that can physically help you - a principle or another teacher may be the best solution.

4 0
3 years ago
_______is a term which describes how the operating system will interrupt the execution of an application when an application of
a_sh-v [17]

Answer:

scheduling

Explanation:

Scheduling- it is referred to as assigning a task to complete the goal or work on time. he works can include data flow, processing of data, etc.

There are two main types of scheduling

1) Preemptive process

2) Non- preemptive process

Preemptive process -  in this process, priority is given to important tasks rather than less important tasks. the current task can be held for an important task

Non-preemptive process -  It is referred to that process when the predefined schedule follows. In this  process, next task executed only when current task finish

6 0
3 years ago
Please help it's my last question
Yuki888 [10]

Explanation:

here is your answer.. of. different between client / server architecture and peer to peer architecture of the network.

6 0
2 years ago
Read 2 more answers
Felicity wants to capture the attention of the regular subway commuters in her area though her print advertisements​
mel-nik [20]

Answer: billboard

Explanation:

Plato answer

8 0
3 years ago
Other questions:
  • How to get 60 fps pubg​
    9·2 answers
  • Dr. Patterson’s office calls to give patient Sara Martin her test results from her most recent visit. Her husband answers the ph
    8·2 answers
  • A(n) _____ might be written by a programmer or it might be created through a DBMS utility program.
    6·1 answer
  • Which environment variable affects the number of past commands used in the current shell session?
    14·1 answer
  • Based on your research and understanding, write a 3- to 4-page Microsoft Word document that:
    11·1 answer
  • What is the difference between a Is your Milling machine and grinding machine
    6·1 answer
  • Difference between ancient and modern mode of information <br> transmission
    12·1 answer
  • When replacing a thermostat or water pump, coolant drained from the cooling system should be ________.
    9·1 answer
  • In a singing competition, there are 34 more men than women
    5·2 answers
  • . Define the process of Technological relationship
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!