This method splits the array values into halves recursively until each half has one element, and then combines values in the halves (in order) to sort the list.
What is merge sort?
200
What is b in the following code? int[] b = new int[10];
What is an integer array of size 10?
200
((lambda (x y z) (y z x)) 14 - 7)
What is -7?
200
father of the Java programming language
Who is James Gosling?
300
this prints out something to the console
What is System.out.println (or System.out.print)?
300
characterized by O(n^2) and usually has an inner-loop and outer-loop to sort an array.
What is bubble sort?
300
what the main method always returns
What is void?
300
the name for programming without any use of assignments.
What is functional programming?
300
the highest award in computer science is named after him
Who is Alan Turing?
400
the length of the string of “computer science is cool”
What is 24?
400
The name of a graph search algorithm that solves the shortest path problem and produces a shortest path tree