For this question, use the following array of values:

[0]	[1]	[2]	[3]	[4]	[5]	[6]	[7]	[8]	[9]	[10]
23	41	66	20	2	90	9	34	19	40	99

What value will be in position [4] after 4 complete passes of the bubble sort?

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

For this question, use the following array of values:

[0]	[1]	[2]	[3]	[4]	[5]	[6]	[7]	[8]	[9]	[10]
23	41	66	20	2	90	9	34	19	40	99

What value will be in position [4] after 3 complete passes of the selection sort?

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

For this question, use the following array of values:

[0]	[1]	[2]	[3]	[4]	[5]	[6]	[7]	[8]	[9]	[10]
23	41	66	20	2	90	9	34	19	40	99

What value will be in position [4] after 5 passes of the insertion sort?

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

What is the order of simple sorting algorithms such as bubble sort, selection sort, and insertion sort?

a. O(n)

b. O(n2)

c. O(logn)

d. O(n!)

Show transcribed image textO (n) 0 (n2) O (log n) O (n!)

Show transcribed image textO (n) O (log n) O (n!)

O (n) 0 (n2) O (log n) O (n!)