Searching ad Sorting

Which of the following best describes the linear search algorithm for an array?

• It checks each element in the sequence until the target is found or the end is reached

• It repeatedly divides the sequence in half to locate the target value

• It sorts the array first then searches for the target using binary search

• It jumps to the middle of the sequence then searches toward one end ond

int[] values = {10, 20, 30};

int target = 25;

int index = -1;

for (int i = 0; i < values.length; i++) {

if (values[i] == target) {

index = i;

}

}

System.out.println(index);

What is the output of the code above?

• ArrayOutOfBoundsException

• -1

• 3

• endless loop

int[] arr = {5, 8, 2, 8, 7};

int target = 8;

int index = -1;

for (int i = 0; i < arr.length; i++) {

if (arr[i] == target) {

index = i;

break;

}

}

System.out.println(index);

}

What is the output of the code above?

• -1

• 1

• 3

• 8

int[] arr = {5, 8, 2, 8, 7};

int target = 8;

int count = 0;

for (int i = 0; i < arr.length; i++) {

if (arr[i] == target) {

count++;

}

}

System.out.println(count);

}

What is the output of the code above?

• 0

• 1

• 2

• 5

Which of the following must be true in order to use binary search on an array?

• The array's elements must be sorted

• The array can't have 2 of the same value

• The array must be divisible by 2

• The array can be in any order to start

If you have a very large array of values (100,000+), which search method is most efficient?

• linear search

• binary search

• both linear search and binary search

What is the output of the code?

• -1

• 2

• 6

• 3

What is the output of the code?

• 5

• 4

• -1

• 12

Which of the following best describes the selection sort algorithm?

• It repeatedly finds the smallest number in the unsorted part of the sequence and swaps it into the correct position

• It repeatedly inserts the next element into a sorted position by shifting elements

• It splits the sequence into smaller parts, sorts those, then merges the sorted parts together

• It swaps adjacent out-of-order elements repeatedly until the array is sorted

What is the output of the code?

• 6

• 5

• 4

• 15