double coolBeans[4];
An ______ is being created here.
What is an array of 4 doubles?
100
int *lol = null;
A _____ is being defined here.
What is a pointer?
100
int myFunction(int x, int y, int z);
This is a ______.
What is a function protoype?
100
The ____ search algorithm steps sequentially through an array, comparing each item with the search value.
What is Linear search
100
This type of algorithm rearranges the values stored in an array in some particular order
What is a Sorting Algorithm
200
for(int i = 0 ; i < SIZE ; i++)
{
cout << "Your value at element " << i+1 << " is: " << array[i];
}
The array is being _____ here.
What is printed?
200
const int ROFL = 20;
int *ptr = nullptr;
ptr = ROFL;
int loL[ptr];
An ______ is being declared here.
What is an array of 20 ints?
200
int myFunction(int x , int y , int z)
{
**Insert juicy code here**
}
This is a ______ .
What is a function definition?
200
The__ search algorithm repeatedly divides the portion of an array being searched in half.
What is Binary search
200
This algorithm begins by sorting the first two elements of the array, which become a sorted subset.
What is Insertion sort?
300
for(int i = 0 ; i < SIZE ; i++)
{
cout << "Enter in your value for element " << i+1 << " in your array: " << endl;
cin >> array[i];
}
The array is being _____ here.
What is being filled/initialized?
300
< ,<=, >, >=, != , ==
These are an example of _____.
What are relational operators?
300
int * myFunction(int x, int y, int z).
The return type of this function is _____.
What is a Int pointer?
300
The___search algorithm requires that the array's contents be sorted.
What is Binary Search
300
In this algorithm, the smallest value in the array is located and moved to element 0
What is Selection sort?
400
Each element of an array is accessed and indexed by a number known as a ______.
What is a subscript?
400
! , && , ||
These are an example of _____.
What are logical operators?
400
Values that are sent into a function are called ____.
What is an argument?
400
This search uses a loop to sequentially step through an array, starting from the first element. IT compares each elements of the array and stops when either the number is found or the end of the array is encountered.
What is Sequential / Linear search
400
This sort requires a swap.
What is Selection sort?
500
const int RO = 10;
const int FL = 20;
int myArray[RO][FL];
A _______ array is being declared here.
What is a 2-Dimensional array?
500
void myFucntion(int x , int y)
{
Random code here
}
This function will return _____.
What is zero/nothing?
500
Special variables that hold copies of function argument are called ______.
What are parameters?
500
Which search is the most efficient for large arrays?
What is Binary Search?
500
This algorithm makes several passes through an array and causes the larger values to gradually move toward the end of the array with each pass.