Out of Sorts
This type of sort algorithm repeatedly searches remaining items to find the least one and moves it to its final location.
Selection Sort
This is a common type of program loop that is controlled by an integer that counts up from a initial value to an upper limit.
Count Controlled Loop
#Python
def main()
print(“Hello World”)
#Python
def main():
print(“Hello World”)
Stores running programs and other types of data on computers.
Memory
This shortcut is used to copy.
Ctrl + C
This sorting algorithm repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Bubble Sort
This type of loop is sometimes called an indefinite repetition loop because the number of iterations is not known before the loop starts executing.
Sentinel Controlled Loop
#C++
Int main(){
cout >> “Hello World”
}
#C++
Int main(){
cout << “Hello World”
}
Performs the math on a computer.
Arithmetic/Logic Unit (ALU)
This shortcut enables full screen.
F11
This sorting algorithm builds the final sorted array (or list) one item at a time.
Insertion Sort
This type of loop is a control flow statement that allows code to be executed repeatedly based on a given Boolean condition.
While Loop/Control Loop
#Java
psvm(String args[]){
System.out.(“Hello World”)
}
#Java
psvm(String args[]){
System.out.println(“Hello World”)
}
A five step process that summarizes how computers run.
Fetch/Execute cycle
This shortcut is used to terminate an unresponsive program.
CTRL + ALT + DELETE
This sorting method repeatedly breaks down a list into several sublists until each sublist consists of a single element and merging those sublists in a manner that results into a sorted list.
Merge Sort
This type of loop is a piece of coding that lacks a functional exit so that it repeats indefinitely.
Infinite Loop
#C++
for(int i = 0; i != 5; i +2)
Do something
#C++
for(int i = 0; i != 5; i ++)
Do something
A computer can only perform one of these at a time.
Instructions
This shortcut runs a program with debugger in visual studio.
F5
This sorting method is a comparison based sorting technique based on Binary Heap data structure.
Heap Sort
While not technically a loop, this method or algorithm invokes itself one or more times with different arguments.
Recursive
int a[5] = {1.5, 2, 3.35, 4, 5.55);
double a[5] = {1.5, 2, 3.35, 4, 5.55);
The language that computers read to carry out instructions.
Binary
This shortcut displays context actions in InteliJ.
ALT + Enter