Sorting/Searching Algorithms

Question 1

How does Bubble Sort work?

Answer 1

• Comparing each x and x+1 index
• Brings the largest number to the right every pass

Question 2

How does Optimized Bubble Sort work?

Answer 2

• Uses a swap flag to stop the method if no swaps are detected in a pass

Question 3

How does Selection Sort work?

Answer 3

• First is chosen as the minimum
• x and x+1 are compared until the smallest is found
• minimum is moved to left
• second is chosen… third… fourth… etc.

Question 4

How does Insertion Sort work?

Answer 4

• The first index is part of the array that is “already sorted”
• The next index is used and put in the part of the array that is already sorted
• A key is used

Question 5

How does Binary Search work?

Answer 5

• Splits an array into halves until the target is found
• Uses a high, low, and mid pointer