Search
A method of finding or getting a piece of data from a list or array
What is Search?
A method of organizing data in a specific order
What is Sort?
the amount of time an algorithm takes to run, in particular considering the theoretical worst case (upper bound) and best case (lower bound) scenarios when running programs
What is computational complexity?
An algorithm that looks through each piece of data in order, starting at the beginning, until it finds the element it is looking for
What is Linear Search?
A sorting method is used to sort variables by arranging them in a order and then comparing 2 values and swapping if necessary continuing till sorted
What is Bubble Sort?
The upper bound computational complexity of Linear Search, where n = number of data points
What is n?
An algorithm that repeatedly divides the data set in 2 to look for the desired element until it is found. Only works with data that has already been sorted.
What is Binary Search?
A sorting method that finds the smallest unsorted element and adds it to the end of a sorted list.
The upper bound computational complexity of Binary Search, where n = number of data points
What is log n?
an algorithm used to sort an array where you think of it, not as a 6 piece array but 6 arrays with 1 piece each. The process is simple by taking 2 pieces and sorting them it becomes an array after that you take 2 arrays and sort them until there is only one array.
What is Merge Sort?
The upper bound computational complexity of all sorting methods (Bubble Sort, Merge Sort, and Insertion Sort), where n = number of data points
What is n2?
An sorting method where the program follows a linear method, taking each new number and placing it in the correct place in order behind it
What is insertion sort?