Bubble Sort

• What does a bubble sort do?

  It compares pairs of items to sort and unordered list
• A positive of the bubble sort is that it is a simple algorithm. Explain why?

  It only focuses on two items rather than the whole list of items (It can also be easily implemented on a computer)
• A positive of the bubble sort is that it can efficiently check (Not sort) a list. Describe how?

  It can check to see if a list is already in order
• A positive of the bubble sort is that it doesn't use much memory. Explain how?

  All the sorting in a bubble sort is done using the original list
• Sure, the bubble sort may be an efficient way to CHECK if a list is already in order, but it is an inefficient way to do what?

  Sort the list
• What is a result of the bubble sort being inefficient?

  It cannot cope well with very large lists