The following algorithm represents the logic of a(n) ____.// Loop pulls each element from 1 to the end of the arrayFor pulledIndex = 1 to ARRAYSIZE - 1 pulledValue = someNums[pulledIndex] insertIndex = pulledIndex // If element to the left is greater, // shift it to the right // and look at the next element to the left While insertIndex > 0 And someNums[insertIndex - 1] > pulledValue someNums[insertIndex] = someNums[insertIndex - 1] insertIndex = insertIndex - 1 End While // Insert the pulled value when the shifting ends someNums[insertIndex] = pulledValueEnd For
A. selection sort
B. insertion sort
C. bubble sort
D. merge sort
Answer: B
Computer Science & Information Technology
You might also like to view...
Designing a Java program is similar to designing an Alice program.
Answer the following statement true (T) or false (F)
Computer Science & Information Technology
An IPv4 address contains __________ bits.
a) eight b) 32 c) 64 d) 128
Computer Science & Information Technology
In the ____________________ window, you can find links to troubleshooters and system recovery tools.
Fill in the blank(s) with the appropriate word(s).
Computer Science & Information Technology
The Unified Medical Language System (UMLS) is distributed by the National Library of Medicine how often
- once a year - every 3 month - every 6 months - biannually
Computer Science & Information Technology