Test
Sin título
Preguntas del test (4)
1True or false: If an array is already sorted, Linear Search / Sequential Search is more efficient than Binary Search.
- Atrue
- Bfalse
2What must be true before performing a binary search?
- AThe elements must be sorted.
- BIt can only contain binary values.
- CThe elements must be some sort of number (i.e. int, double, Integer)
- DThere are no necessary conditions.
3Which of the following functions is a proper implementation of binary search?
- Apublic static int binarySearch(int[] array, int key)
{
int n = array.length;
int first = 0;
int last = n - 1;
int middle = (first + last)/2;
while( first <= last )
{
if ( array[middle] < key )
{
first = middle + 1;
}
else if ( array[middle] == key )
{
return (middle + 1);
}
else
{
last = middle - 1;
}
middle = (first + last)/2;
}
return -1;
} - Bpublic static int binarySearch(int[] array, int key)
{
int n = array.length;
int first = 0;
int last = n - 1;
int middle = (first + last)/2;
while( first <= last )
{
if ( array[middle] < key )
{
first = middle + 1;
}
else if ( array[middle] == key )
{
return middle;
}
else
{
last = middle - 1;
}
middle = (first + last)/2;
}
return -1;
} - Cpublic static int binarySearch(int[] array, int key)
{
n = array.length;
first = 0;
last = n - 1;
middle = (first + last)/2;
while( first <= last )
{
if ( array[middle] < key )
{
first = middle + 1;
}
else if ( array[middle] == key )
{
System.out.println(key + " found at index " + middle);
}
else
{
last = middle - 1;
}
middle = (first + last)/2;
}
System.out.println("Key not found!")
} - Dpublic static int binarySearch(int[] array, int key)
{
int n = array.length;
int first = 0;
int last = n - 1;
int middle = (first + last)/2;
while( first <= last )
{
if ( array[middle] < key )
{
first = middle + 1;
}
else if ( array[middle] == key )
{
int result = middle;
}
else
{
last = middle - 1;
}
middle = (first + last)/2;
}
}
- Apublic static int binarySearch(int[] array, int key)
4Given this array:
1 2 4 5 6 7 8 12 14 21 22 42 53
How many comparisons are required to find 42 using the Linear Search / Sequential Search?- A3
- B2
- C12
- D5
Información
- Descripción
- Test sobre Sin título, creado por Adrian Mendoza el 01/02/2023.
- Autor
- Adrian Mendoza
- Idioma
- English
- Visitas
- 0
- Etiquetas
- Valoración
- Aún sin valoraciones Valora este test