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
Mamont248 [21]
3 years ago
9

In each iteration, selection sort (small) places which element in the correct location?

Computers and Technology
1 answer:
Jet001 [13]3 years ago
7 0
The answer is <span>smallest not yet placed.  </span><span>In each iteration, selection sort  places smallest not yet placed element in the correct location.  </span>
You might be interested in
Match each item with a statement below. - A parameter in a method header. - A set of methods that can accept a call given the pa
Bas_tet [7]

Answer:

                                 

Explanation:

6 0
3 years ago
The ________ is responsible for the Internet's domain name system and the allocation of IP addresses. ICANN W3C ISOC IAB
Maurinko [17]

Answer:

ICANN

Explanation:

It handles the installation and processing of various databases related to network domains and provides a consistent and secure networking service and there are incorrect options are described as follows:

  • IAB, which provides a protocol for managing IETF, is therefore incorrect.
  • W3C is used in web development.
  • ISOC is used to provide Internet access.
7 0
3 years ago
Create a function called makePositive that accepts a single argument: an integer array. The function should walk through the arr
coldgirl [10]

Answer:

This solution is implemented in C++

void makePositive(int arr[]){

   int i =0;

   while(arr[i]!=0){

       if(arr[i]<0){

           arr[i] = abs(arr[i]);

       }

       i++;

   }

   i = 0;

   while(arr[i]!=0){

    cout<<arr[i]<<" ";

    i++;

}  

}

Explanation:

This defines the function makePositive

void makePositive(int arr[]){

This declares and initializes i to 0

   int i =0;

The following iteration is repeated until the last element in the array

   while(arr[i]!=0){

This checks if current array element is negative

       if(arr[i]<0){

If yes, it changes it to positive

           arr[i] = abs(arr[i]);

       }

The next element is then selected

       i++;

   }

This sets i to 0

   i = 0;

The following iteration prints the updated content of the array

<em>    while(arr[i]!=0){ </em>

<em>     cout<<arr[i]<<" "; </em>

<em>     i++; </em>

<em> }   </em>

}

See attachment for full program which includes the main

Download cpp
8 0
2 years ago
To copy consecutive items, click the first item in the group, hold down _______, and click the last item
Nikitich [7]
C. Shift , you can control click to select one at a time
7 0
3 years ago
Read 2 more answers
A mistake programmers often make with loops is that they ____.
Soloha48 [4]

I think the best answer is D. Initialize the loop control variable prior to entering the loop body.

Please correct me if I'm wrong!! I'd be happy to fix it!! :)

4 0
3 years ago
Other questions:
  • Vannevar bush imagined a desktop computing machine that would allow people to access data stored in various information centers
    10·1 answer
  • In the movie evacuees, why were the children evacuated from large cities?
    11·1 answer
  • How works GPS on boats?
    12·1 answer
  • What items do you keep in a data base
    5·1 answer
  • Write a program that asks the user for three strings.
    13·1 answer
  • Using Phyton
    9·1 answer
  • Analyze the code and identity the value of variable a,b and c after the code execution. int a=40, b=50, c=60; if(! (a&gt;=40)) b
    15·1 answer
  • Unscramble thr words <br>1.Nsieg Wiev<br>2.Seeathdat ievw​
    13·2 answers
  • Can someone pls do a toradora,Mha or princess jellyfish rp I'm open for anyother rp's
    11·2 answers
  • Computer science student jones has been assigned a project on how to set up sniffer. What just he keep in mind as part of the pr
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!