Exam 12: Searching and Sorting

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..

____________________ is the process of arranging a group of items into a defined order.

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!"); } } }

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.

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

_____________________ is the process of finding a designated target element within a group of items.

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]);

As the number of items in a search pool grows, the number of comparisons required to search _______________ .

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

Which of the following is not a sorting algorithm?

Explain what O(1) means.

Which of the following algorithms has a time complexity of O(log₂ n)?

A linear search is more efficient than a binary search.

Bubble sort is the most efficient searching algorithm.

Suppose we have algorithms that solve a particular problem that have the following complexities. Which one is most efficient?

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

A _______________ search is more efficient than 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];

A __________________ search looks through the search pool one element at a time.

The ___________________ algorithm sorts values by repeatedly comparing neighboring elements in the list and swapping their position if the are not in order relative to each other.