Bubble sort, quicksort, selection sort, and insertion sort are common sorting algorithms. Bubble sort is one of the simplest but least efficient, comparing adjacent elements and swapping them if out of order. Quicksort chooses a pivot element and partitions the list into sublists based on element values relative to the pivot, then recursively sorts the sublists. Selection sort finds the minimum element and swaps it into sorted position, repeating for remaining elements. Insertion sort inserts elements one by one into sorted position in the list. Sorting algorithms are important for organizing data efficiently and are used in applications like search and output formatting.

1. Sorting AlgorithmsBy Bianca Lopez, Meg Schreck, ShantiMechery

2. What is A Sorting AlgorithmAlgorithma precise rule (or set of rules) specifying how to solve some problem.Sorting AlgorithmIn computer science and mathematics, a sorting algorithm is an algorithm that puts elements of a list in a certain order.

3. Bubble SortOne of the earliest sorting algorithms (Was analyzed as early as 1950)Widely used as the first example of a sorting algorithmIs one of the simplest sorting algorithmOne of the algorithms that takeslongest amount of time to sortGets it name from the way smaller elements “bubble” to the top of the list.It is a comparison sort. (It compares each card individually with the card next to it)

4. QuicksortQuicksort is a widely used sorting algorithm invented by C. A. R. Hoare in 1960.It was invented for looking up words in the dictionary more efficientIts popularity has lasted since its invention because it’s easy to perform, is a “general purpose” sort, and has an efficient running time. One of the algorithms that takes the shortest amount of time to sort things with.

5. ExamplesBubble Sort Explained With Height!Choose the first and second person to focus on. Switch them so the shorter person is on the left.Repeat for the second and third person.Keep going through the row, comparing the people’s height next to each other and switching them if needed. Do this until all of the people are sorted from shortest to tallestQuicksort Explained With Height!Choose a random personChoose another person. If it is taller than the original person you chose, he/she should be on the right of the original person. If the person is smaller compared to the person you chose, put it to the left. Do this until each person is on one side of the original person.Repeat the first 2 steps until all the people are in order from shortest to tallest.

6. ExamplesSelection Sort Explained Though Height!Put 5 people in a random lineLook at two people at a time until you find the one with the shortest heightRearrange remaining peopleRepeat steps 2-3 until you have all of the people in order according to heightInsertion Sort Explained Through Height!Put 5 people in a random lineChoose one person in line to focus onChoose a new person and place it the right of the first person if it is shorter and left of the first if it is tallerRepeat until everyone is in order according to height

7. Is it EfficientThe efficiency of a sorting algorithm depends on the number of moves and comparisons.One of the most efficient sorting algorithms is Quicksort. One of the least efficient sorting algorithms is Bubble Sort.

8. The Importance and Uses of Sorting Algorithms

9. Uses of Sorting AlgorithmsUsed for converting data and for producing human-readable outputUsed for search algorithms when picking relevant resultsSorting amounts of data in java and excelCompanies and hospitals use Sorting Algorithms to sort records

10. Importance of Sorting Algorithmshelp you order elements that are in a list.order any list that could be used and they compare data that is sortedIt is used to sort any data that is unordered or partially orderedSave time!

11. Thoughts on Sorting AlgorithmsIt was worth learningMade order/sorting easier We now know how computers sort!We now know how to use computers to sort - good skill to know!

12. Thank You for watching our presentation!