General Principles
The array should be sorted.
This diagrammatic method represents the step-by-step process of an algorithm, using shapes such as diamonds and rectangles.
What is flowchart?
This diagrammatic method represents the step-by-step process of an algorithm, using shapes such as diamonds and rectangles.
What is a while loop?
This algorithm traverses through each element of a linear array to find a specific value.
What is linear search?
what does the operator MOD do?
returns the remainder
What is abstraction?
Abstraction is a technique for managing the complexity of computer systems.
This keyword is used in pseudocode to execute a block of code a specific number of times.
What is "for"?
This term refers to a storage location in a program that can hold data that may change during execution.
What is a variable?
This algorithm is typically suggested for searching a sorted array by repeatedly dividing the search space in half.
What is binary search?
loops organized in layers (where one is inside of another)
nested loops
GANNT Chart is an example of this type of planning...
Pre-Planning
It translates and executes code line by line.
What is interpreter?
In pseudocode, this structure is used to handle decision-making by branching the algorithm based on conditions.
What is an 'if-else' statement?
What is the loop structure for the collections?
loop while COLLECTION.hasNext()
What are the three languages within computer language?
low-level, assembly code, and high-level language.
In larger problems, these smaller components can help break down a task into manageable pieces.
What are sub-procedures?
This is the efficiency of binary search when applied to a sorted array.
O(log n)
These languages are designed to be easier for humans to read and write, abstracting away the complexities of machine code.
What are higher level languages?
Which operation adds an element to the end of a collection?
What does O(1) time complexity represent in an algorithm's efficiency?
Constant time, where the number of operations does not depend on the input size.
This type of processing allows multiple tasks to be executed simultaneously to solve a problem more efficiently.
What is concurrent processing?
This term refers to the number of times an algorithm’s operations will be executed relative to input size
What is time complexity?
loop I from 0 to N
loop J from 0 to I
loop K from 0 to J
What is the time complexity for this code?
Cubic (n3)
If n2 algorithm takes 1 minute to sort X elements, how long will it take to sort 2X elements?
4 minutes
In pseudocode, how would you swap two values in an array?
TEMP = NUMS[I]
NUMS[I] = NUMS[J]
NUMS[J] = TEMP