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
adelina 88 [10]
3 years ago
6

Insurance can help you:a. minimize monthly expenses

Computers and Technology
1 answer:
KIM [24]3 years ago
4 0
This is an easy answer sure in the back of your mind u knew it was b good luck :).

You might be interested in
From the binary search algorithm, it follows that every iteration of the while loop cuts the size of the search list by half.
Colt1911 [192]

Answer:

True: In binary search algorithm, we follow the below steps sequentially:

Input: A sorted array  B[1,2,...n] of n items and one item x to be searched.

Output: The index of x in B if exists in B, 0 otherwise.

  1. low=1
  2. high=n
  3. while( low < high )
  4.  {      mid=low + (high-low)/2
  5.         if( B[mid]==x)
  6.          {
  7.             return(mid)  //returns mid as the index of x
  8.           }
  9.          else
  10.          {
  11.              if( B[mid] < x)      //takes only right half of the array
  12.               {
  13.                 low=mid+1
  14.               }
  15.              else               // takes only the left half of the array
  16.               {
  17.                high=mid-1
  18.               }
  19.           }
  20.  }
  21. return( 0 )

Explanation:

For each iteration the line number 11 or line number 15 will be executed.

Both lines, cut the array size to half of it and takes as the input for next iteration.

6 0
3 years ago
What is the most common example of a magnetic storage medium in a personal computer
AnnyKZ [126]

Answer: magnetic tape, floppy disks and hard-disk drives

Explanation:

5 0
3 years ago
Give a recursive version of the algorithm Insertion-Sort (refer to page 18 in the textbook) that works as follows: To sort A[1..
Inga [223]

Answer:

see explaination

Explanation:

void insertion( int e,int *x, int start, int end)

{

if (e >= x[end])

x[end+1] = e;

else if (start < end)

{

x[end+1] = x[end];

insertion(e, x, start, end-1);

}

else

{

x[end+1] = x[end];

x[end] = e;

}

}

void insertion_recurssion(int *b, int start, int end)

{

if(start < end)

{

insertion_sort_recur(b, start, end-1);

insertion(b[end], b, start, end-1);

}

}

void main()

{

insertion_recurssion(x,0,5);

}

3 0
2 years ago
+
quester [9]

Answer:

Network administrator

5 0
3 years ago
Read 2 more answers
What is the term for a program that performs a repetitive task on a network?
Andrews [41]
Bot. A program that performs a repetitive task on a network. Cybercriminals install malicous bots on unprotected computers to create a botnet. Zombie army. (also calledBotnet) groups of bots
7 0
3 years ago
Other questions:
  • Why is e-mail better for informative and positive messages than for negative ones?
    6·1 answer
  • How many bytes are in 1 kilobyte of storage
    13·1 answer
  • HELP ASAP!!!
    11·2 answers
  • What is the effect of block size in cache design?
    12·1 answer
  • Assuming 8-bit 2's complement notation, what is the result of subtracting 00001001 from 00001101?
    11·1 answer
  • What is the purpose of a Post Mortem Review? (5 points)
    5·1 answer
  • PLZZZZ help will give brainlest
    5·1 answer
  • How to resize an image in photoshop without losing quality.
    11·1 answer
  • Which of the following best explains how algorithms that run on a computer can be used to solve problems?
    5·1 answer
  • Write a function called printRange() that accepts two integers as arguments and prints the sequence of numbers between the two a
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!