Upcoming SlideShare
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×

# Saving this for later?

### Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime - even offline.

Standard text messaging rates apply

# Sorting Algorithms

2,356
views

Published on

Published in: Education

0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

• Be the first to like this

Views
Total Views
2,356
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
0
0
Likes
0
Embeds 0
No embeds

No notes for slide

### Transcript

• 1. Sorting AlgorithmsBy Bianca Lopez, Meg Schreck, ShantiMechery
• 2. What is A Sorting Algorithm
Algorithm
a precise rule (or set of rules) specifying how to solve some problem.
Sorting Algorithm
In computer science and mathematics, a sorting algorithm is an algorithm that puts elements of a list in a certain order.
• 3. Bubble Sort
One of the earliest sorting algorithms (Was analyzed as early as 1950)
Widely used as the first example of a sorting algorithm
Is one of the simplest sorting algorithm
One of the algorithms that takeslongest amount of time to sort
Gets 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. Quicksort
Quicksort 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 efficient
Its 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. Examples
Bubble 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 tallest
Quicksort Explained With Height!
Choose a random person
Choose 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. Examples
Selection Sort Explained Though Height!
Put 5 people in a random line
Look at two people at a time until you find the one with the shortest height
Rearrange remaining people
Repeat steps 2-3 until you have all of the people in order according to height
Insertion Sort Explained Through Height!
Put 5 people in a random line
Choose one person in line to focus on
Choose a new person and place it the right of the first person if it is shorter and left of the first if it is taller
Repeat until everyone is in order according to height
• 7. Is it Efficient
The 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 Algorithms
Used for converting data and for producing human-readable output
Used for search algorithms when picking relevant results
Sorting amounts of data in java and excel
Companies and hospitals use Sorting Algorithms to sort records
• 10. Importance of Sorting Algorithms