Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Which x x x completes the following C + + insertion sort algorithm in ascending order? void InsertionSort ( int * numbers, int numbersSize )

Which xxx completes the following C++ insertion sort algorithm in ascending order?
void InsertionSort (int* numbers, int numbersSize){
for (int i=1; i numberssize; i++){
int j=i;
while (XXX){
??? Swap numbers j and numbers j-1
int temp = numbers j;
numbers [j]= numbers j-1;
numbers [j-1]= temp;
j--;
}
}
}
j>i && numbers [j] numbers i
numbers [j] numbers j-1 && j>0
j>0 && numbers [j] numbers j-1
j0 && numbers [j]> numbers j-1
image text in transcribed

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Processing Fundamentals Design

Authors: Marion Donnie Dutton Don F. Seaman

14th Edition Globel Edition

1292107634, 978-1292107639

More Books

Students also viewed these Databases questions

Question

8. Explain the contact hypothesis.

Answered: 1 week ago

Question

2. Define the grand narrative.

Answered: 1 week ago