Presentation is loading. Please wait.

Presentation is loading. Please wait.

Decision Maths 1 Sorting Algorithms Bubble Sort A V Ali : www.2july-maths.co.uk 1.Start at the beginning of the data set. 2.Compare the first two elements,

Published byIsabell Templer Modified over 9 years ago

Similar presentations

Presentation on theme: "Decision Maths 1 Sorting Algorithms Bubble Sort A V Ali : www.2july-maths.co.uk 1.Start at the beginning of the data set. 2.Compare the first two elements,"— Presentation transcript:

1 Decision Maths 1 Sorting Algorithms Bubble Sort A V Ali : www.2july-maths.co.uk 1.Start at the beginning of the data set. 2.Compare the first two elements, and if the first is greater than the second, swaps them. 3.Continue doing this for each pair of adjacent elements to the end of the data set. 4.Start again with the first two elements, repeating until no swaps have occurred on the last pass.

2 57 3 12 9 5 Bubble Sort Pass 1 57 31295 57 3 95 55 3 97 55 3 97 55 397

3 55 97 3 Pass 2 55 93127 55 93 7 55 93 7 55 97 3

4 55 93 7 Pass 3 55 97123 55 97 3 53 97 5

5 53 95 7 Pass 4 53 97125 35 97 5

6 35 95 7 Pass 5 35 97125 35 97 5 Sorted !!!

Download ppt "Decision Maths 1 Sorting Algorithms Bubble Sort A V Ali : www.2july-maths.co.uk 1.Start at the beginning of the data set. 2.Compare the first two elements,"

Similar presentations

SortingTechniques. Bubble-sort: One of the simplest sorting methods. The basic idea is the weight of the record. The records are kept in an array held.

SortingTechniques. Bubble-sort: One of the simplest sorting methods. The basic idea is the weight of the record. The records are kept in an array held.
Bubble Sort Example 9, 6, 2, 12, 11, 9, 3, 7 6, 9, 2, 12, 11, 9, 3, 7 Bubblesort compares the numbers in pairs from left to right exchanging.

Bubble Sort Example 9, 6, 2, 12, 11, 9, 3, 7 6, 9, 2, 12, 11, 9, 3, 7 Bubblesort compares the numbers in pairs from left to right exchanging.
Consider an array of n values to be sorted into ascending order. Sorting.

Consider an array of n values to be sorted into ascending order. Sorting.
Bubble Sort Algorithm It is so named because numbers (or letters) which are in the wrong place “bubble-up” to their correct positions (like fizzy lemonade)

Bubble Sort Algorithm It is so named because numbers (or letters) which are in the wrong place “bubble-up” to their correct positions (like fizzy lemonade)
Sorting CMSC 201. Sorting In computer science, there is often more than one way to do something. Sorting is a good example of this!

Sorting CMSC 201. Sorting In computer science, there is often more than one way to do something. Sorting is a good example of this!
Sorting A fundamental operation in computer science (many programs need to sort as an intermediate step). Many sorting algorithms have been developed Choose.

Sorting A fundamental operation in computer science (many programs need to sort as an intermediate step). Many sorting algorithms have been developed Choose.
VISUAL C++ PROGRAMMING: CONCEPTS AND PROJECTS Chapter 9A Sorting (Concepts)

VISUAL C++ PROGRAMMING: CONCEPTS AND PROJECTS Chapter 9A Sorting (Concepts)
Visual C++ Programming: Concepts and Projects

Visual C++ Programming: Concepts and Projects
Search and Sort.

Search and Sort.
SORTING. Selection Sort (Basic) 1. Find the smallest element 2. Move to the front of the array (swap with front) 3. Repeat Steps 1&2, but ignore the sorted.

SORTING. Selection Sort (Basic) 1. Find the smallest element 2. Move to the front of the array (swap with front) 3. Repeat Steps 1&2, but ignore the sorted.
1 Sorting II: Bubble Sort and Selection Sort CSC326 Information Structure Spring 2009.

1 Sorting II: Bubble Sort and Selection Sort CSC326 Information Structure Spring 2009.
Exchange Sorting CS-240 Dick Steflik. Exchange Sort Strategy Make n-1 compares of adjacent items, swapping when needed Do this n-1 times with one less.

Exchange Sorting CS-240 Dick Steflik. Exchange Sort Strategy Make n-1 compares of adjacent items, swapping when needed Do this n-1 times with one less.
Searches & Sorts V22.0002.001 Deena Engel’s class Adapted from W. Savitch’s text An Introduction to Computers & Programming.

Searches & Sorts V Deena Engel’s class Adapted from W. Savitch’s text An Introduction to Computers & Programming.
Selection Sorting CS-240 Dick Steflik. Selection Sort Strategy Find the largest item by making n-1 compares, swap the largest item with the last item.

Selection Sorting CS-240 Dick Steflik. Selection Sort Strategy Find the largest item by making n-1 compares, swap the largest item with the last item.
QuickSort QuickSort is often called Partition Sort. It is a recursive method, in which the unsorted array is first rearranged so that there is some record,

QuickSort QuickSort is often called Partition Sort. It is a recursive method, in which the unsorted array is first rearranged so that there is some record,
Discrete Math CSC151 Analysis of Algorithms. Complexity of Algorithms  In CS it's important to be able to predict how many resources an algorithm will.

Discrete Math CSC151 Analysis of Algorithms. Complexity of Algorithms  In CS it's important to be able to predict how many resources an algorithm will.
Algorithms for Sorting Things. Why do we need to sort things? Internal Telephone Directory –sorted by department then by name My local video store holds.

Algorithms for Sorting Things. Why do we need to sort things? Internal Telephone Directory –sorted by department then by name My local video store holds.
12 8 8 8 6 66 1722 Selection Sort Given n numbers to sort: Repeat the following n-1 times:  Mark the first unsorted number  Find the smallest unsorted.

Selection Sort Given n numbers to sort: Repeat the following n-1 times:  Mark the first unsorted number  Find the smallest unsorted.
Advance Data Structure 1 College Of Mathematic & Computer Sciences 1 Computer Sciences Department م. م علي عبد الكريم حبيب.

Advance Data Structure 1 College Of Mathematic & Computer Sciences 1 Computer Sciences Department م. م علي عبد الكريم حبيب.
CSC220 Data Structure Winter

CSC220 Data Structure Winter

Similar presentations

Ads by Google