Principles of Computer Science Question and Answer 100% Correct

Principles of Computer Science Question and Answer 100% Correct Quick Sort - In this algorithm one the elements in the list is selected as the pivot and the smaller elements are placed on the left of it and the larger elements are placed to the right. Bubble Sort - This algorithm works through a list, comparing pairs of values and swapping them if necessary. This process is repeated until the list is in order. Selection Sort - This algorithm works through each element in the list to find the smallest element. The smallest element then swaps places with the first element. Linear Search - The simplest searching algorithm, it starts at the first element in the list and checks every element until it finds the one it is looking for. The problem with this method is it isn't very efficient. Binary Search - A good way of searching lists that have been sorted. At each step it halves the number of items it needs to look at. Traversal - The process of searching a tree by visiting each node in a tree once