Question 1

Write a method that accepts an array of integers as a parameter and sorts them using the selection sort algorithm.

Accepted Answer

The answer of Write a method that accepts an array...

Question 2

To represent constant time complexity we use O(c).

Accepted Answer

To represent constant time complexity, we use O(1).

Question 3

The selection sort algorithm sorts a list of values by repeatedly putting a particular value into its final, sorted position.

Accepted Answer

The selection sort algorithm finds the value that goes into the next open spot in the list and puts it there.

Question 4

Explain how merge sort works.

Accepted Answer

The answer of Explain how merge sort works....

Question 5

Write out the state while being sorted using the insertion sort algorithm:

Accepted Answer

The answer of Write out the state while being sorted...

Question 6

Write a method that accepts an integer array as a parameter and sorts it using the bubble sort algorithm.

Accepted Answer

The answer of Write a method that accepts an integer...

Question 7

Write out the state of the list while being sorted using the selection sort algorithm:

Accepted Answer

The answer of Write out the state of the list...

Question 8

What is the complexity of the following code (in terms of the length of the array)?
for(int i = 0; i < 5; i++)
System.out.println(array[i]);

Accepted Answer

The answer of What is the complexity of the following...

Question 9

What is the complexity of the following code (in terms of the length of the array), assuming someMethod has a complexity of O(1)?
for(int i = 0; i < array.length; i++)
for(int j = 0; j < array.length; j++)
someMethod(array[j]);

Accepted Answer

The answer of What is the complexity of the following...

Question 10

Write a method that accepts an integer and an array of integers, and returns true if the integer is contained in the array. The method should use a linear search.

Accepted Answer

The answer of Write a method that accepts an integer...

Question 11

Suppose we would like to swap the elements at index i and index j in an array. Does the following code work? If so, explain how. If not, explain why it fails.
array[i] = array[j];
array[j] = array[i];

Accepted Answer

The answer of Suppose we would like to swap the...

Question 12

In the binary search algorithm, if the number of elements in the search pool is even, which value is used as the midpoint? Explain.

Accepted Answer

The answer of In the binary search algorithm, if the...

Question 13

Bubble sort works by separating a list into two lists, recursively sorting the two lists using bubble sort, and then combining the sorted sublists into a sorted list.

Accepted Answer

Bubble sort is not a recursive sort - the sort described is Merge sort.

Question 14

Quick sort works by separating a list into two lists, and recursively sorting the two lists using quick sort.

Accepted Answer

Quick sort is easily expressible as a recursive algorithm, and it works by dividing a list into two lists, and then recursively sorting the two lists using quick sort.

Question 15

Explain why a faster computer can never make an exponential time algorithm run faster than a polynomial time algorithm on all inputs.

Accepted Answer

The answer of Explain why a faster computer can never...

Question 16

Explain what O(1) means.

Accepted Answer

The answer of Explain what O(1) means....

Question 17

How many times will the following code print out Hello World (in terms of the length of the array)?
for(int i = 0; i < array.length; i++) {
for(int j = 0; j < array.length; j++) {
for(int k = 0; k < array.length; k++) {
System.out.println("Hello World!");
}
}
}

Accepted Answer

The answer of How many times will the following code...

Question 18

Explain how quick sort works.

Accepted Answer

The answer of Explain how quick sort works....

Question 19

With each comparison, a binary search eliminates approximately half of the items remaining in the search pool.

Accepted Answer

A binary search cuts the number of items remaining in the search pool in half with each comparison.

Question 20

Write a method that accepts an integer and an array of integers, and returns true if the integer is contained in the array. You may assume that the array is sorted, and your method should use a binary search..

Accepted Answer

The answer of Write a method that accepts an integer...

Quiz 12: Searching and Sorting

Write a method that accepts an array of integers as a parameter and sorts them using the selection sort algorithm.

To represent constant time complexity we use O(c).

The selection sort algorithm sorts a list of values by repeatedly putting a particular value into its final, sorted position.

Explain how merge sort works.

Write out the state while being sorted using the insertion sort algorithm:

Write a method that accepts an integer array as a parameter and sorts it using the bubble sort algorithm.

Write out the state of the list while being sorted using the selection sort algorithm:

What is the complexity of the following code (in terms of the length of the array)? for(int i = 0; i < 5; i++) System.out.println(array[i]);

What is the complexity of the following code (in terms of the length of the array), assuming someMethod has a complexity of O(1)? for(int i = 0; i < array.length; i++) for(int j = 0; j < array.length; j++) someMethod(array[j]);

Write a method that accepts an integer and an array of integers, and returns true if the integer is contained in the array. The method should use a linear search.

Suppose we would like to swap the elements at index i and index j in an array. Does the following code work? If so, explain how. If not, explain why it fails. array[i] = array[j]; array[j] = array[i];

In the binary search algorithm, if the number of elements in the search pool is even, which value is used as the midpoint? Explain.

Bubble sort works by separating a list into two lists, recursively sorting the two lists using bubble sort, and then combining the sorted sublists into a sorted list.

Quick sort works by separating a list into two lists, and recursively sorting the two lists using quick sort.

Explain why a faster computer can never make an exponential time algorithm run faster than a polynomial time algorithm on all inputs.

Explain what O(1) means.

How many times will the following code print out Hello World (in terms of the length of the array)? for(int i = 0; i < array.length; i++) { for(int j = 0; j < array.length; j++) { for(int k = 0; k < array.length; k++) { System.out.println("Hello World!"); } } }

Explain how quick sort works.

With each comparison, a binary search eliminates approximately half of the items remaining in the search pool.

Write a method that accepts an integer and an array of integers, and returns true if the integer is contained in the array. You may assume that the array is sorted, and your method should use a binary search..