Presentation is loading. Please wait.

Presentation is loading. Please wait.

Vladimir Joanna Joel Eric Yoel Adriana Lance Aaron Divide into two problems.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Vladimir Joanna Joel Eric Yoel Adriana Lance Aaron Divide into two problems."— Presentation transcript:

1 Vladimir Joanna Joel Eric Yoel Adriana Lance Aaron Divide into two problems

2 Vladimir Joanna Joel Eric YoelAdrianaLanceAaron Sort each list recursively

3 VladimirJoannaJoelEricYoelAdrianaLanceAaron Sort each list recursively

4 VladimirJoannaJoelEricYoelAdrianaLanceAaron Merge the two lists

5 VladimirJoannaJoelEricYoelAdrianaLanceAaron Merge the two lists

6 VladimirJoannaJoelEricYoelLance Merge the two lists AaronAdriana

7 VladimirJoannaJoelYoelLance Merge the two lists AaronAdrianaEric

8

9 Counting Inversions 47621583 Divide into front and back halves 47621583 Count inversions within each half, and sort each half 24671358 3 4 Then, count inversions between front and back half

10 Counting Inversions between front and back 2467 1358 front: back: Merge. Whenever a back item is pushed up, count how many it goes past

11 Counting Inversions between front and back 2467 1358 front: back: Merge. Whenever a back item is pushed up, count how many it goes past skips over 2, 4, 6 and 7 Inversions: 4

12 Counting Inversions between front and back 2467 358 front: back: Merge. Whenever a back item is pushed up, count how many it goes past from front, nothing to count 1 Inversions: 4

13 Counting Inversions between front and back 467 358 front: back: Merge. Whenever a back item is pushed up, count how many it goes past from front, nothing to count 1 2 Inversions: 4

14 Counting Inversions between front and back front: back: Merge. Whenever a back item is pushed up, count how many it goes past 3 skips over 4, 6, and 7 1 2 Inversions: 7 358 467

15 Inversions: 4 Counting Inversions between front and back front: back: Merge. Whenever a back item is pushed up, count how many it goes past 3 skips over 4, 6, and 7 1 2 Inversions: 7 3 58 467

16 Inversions: 4 Counting Inversions between front and back front: back: Merge. Whenever a back item is pushed up, count how many it goes past 4 is in front: no change 1 2 Inversions: 7 3 58 4 67

17 Inversions: 4 Counting Inversions between front and back front: back: Merge. Whenever a back item is pushed up, count how many it goes past 5 moves past 6 and 7 1 2 Inversions: 9 35 8 4 67

18 Inversions: 4 Counting Inversions between front and back front: back: Merge. Whenever a back item is pushed up, count how many it goes past 5 moves past 6 and 7 1 2 Inversions: 9 35 8 4 67

Download ppt "Vladimir Joanna Joel Eric Yoel Adriana Lance Aaron Divide into two problems."

Similar presentations

1. PROCEDURE MERGE SORT (list, first, last) If (first < last) middle = (first + last) div 2 2. Merge Sort (list, first, middle) 3. Merge Sort (list, middle+1,

1. PROCEDURE MERGE SORT (list, first, last) If (first < last) middle = (first + last) div 2 2. Merge Sort (list, first, middle) 3. Merge Sort (list, middle+1,
Divide & Conquer n Divide into two halves n Recursively sort the two n Merge the two sorted lists 1 ALGORITHMS Merge Sort.

Divide & Conquer n Divide into two halves n Recursively sort the two n Merge the two sorted lists 1 ALGORITHMS Merge Sort.
1 101418193716172325211 Merge and Count Merge and count step. n Given two sorted halves, count number of inversions where a i and a j are in different.

Merge and Count Merge and count step. n Given two sorted halves, count number of inversions where a i and a j are in different.
1 Merge Sort Review of Sorting Merge Sort. 2 Sorting Algorithms Selection Sort uses a priority queue P implemented with an unsorted sequence: –Phase 1:

1 Merge Sort Review of Sorting Merge Sort. 2 Sorting Algorithms Selection Sort uses a priority queue P implemented with an unsorted sequence: –Phase 1:
Efficient Sorts. Divide and Conquer Divide and Conquer : chop a problem into smaller problems, solve those – Ex: binary search.

Efficient Sorts. Divide and Conquer Divide and Conquer : chop a problem into smaller problems, solve those – Ex: binary search.
1 101418193716172325211 Merge and Count Merge and count step. n Given two sorted halves, count number of inversions where a i and a j are in different.

Merge and Count Merge and count step. n Given two sorted halves, count number of inversions where a i and a j are in different.
Faster Sorting Methods Chapter 9 Copyright ©2012 by Pearson Education, Inc. All rights reserved.

Faster Sorting Methods Chapter 9 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
1 Merge and Quick Sort Quick Sort Reading p. 695-702.

1 Merge and Quick Sort Quick Sort Reading p
Lecture 32 CSE 331 Nov 18, 2009. HW 8 solutions Friday.

Lecture 32 CSE 331 Nov 18, HW 8 solutions Friday.
Selection Sort 345012 641532. 345012 6 41532 345012 64 1532.

Selection Sort
Skip Counting Counting by 2, 5, and 10.

Skip Counting Counting by 2, 5, and 10.
MergeSort Source: Gibbs & Tamassia. 2 MergeSort MergeSort is a divide and conquer method of sorting.

MergeSort Source: Gibbs & Tamassia. 2 MergeSort MergeSort is a divide and conquer method of sorting.
Sorting and Searching Arrays CSC 1401: Introduction to Programming with Java Week 12 – Lectures 1 & 2 Wanda M. Kunkle.

Sorting and Searching Arrays CSC 1401: Introduction to Programming with Java Week 12 – Lectures 1 & 2 Wanda M. Kunkle.
1 101418193716172325211 Counting Inversions Merge and count step. n Given two sorted halves, count number of inversions where a i and a j are in different.

Counting Inversions Merge and count step. n Given two sorted halves, count number of inversions where a i and a j are in different.
Calculating VAT no calculator 17.5% ©Mathematics Education Centre, Loughborough University.

Calculating VAT no calculator 17.5% ©Mathematics Education Centre, Loughborough University.
The Hands of Time The long hand is the minute hand.

The Hands of Time The long hand is the minute hand.
By: Lokman Chan Recursive Algorithm --------. Recursion -------- Definition: A function that is define in terms of itself. Goal: Reduce the solution to.

By: Lokman Chan Recursive Algorithm Recursion Definition: A function that is define in terms of itself. Goal: Reduce the solution to.
ECE 250 Algorithms and Data Structures Douglas Wilhelm Harder, M.Math. LEL Department of Electrical and Computer Engineering University of Waterloo Waterloo,

ECE 250 Algorithms and Data Structures Douglas Wilhelm Harder, M.Math. LEL Department of Electrical and Computer Engineering University of Waterloo Waterloo,
Selection Sort 345012 641532. 345012 6 41532 345012 64 1532.

Selection Sort
Chapter 8 Sorting and Searching Goals: 1.Java implementation of sorting algorithms 2.Selection and Insertion Sorts 3.Recursive Sorts: Mergesort and Quicksort.

Chapter 8 Sorting and Searching Goals: 1.Java implementation of sorting algorithms 2.Selection and Insertion Sorts 3.Recursive Sorts: Mergesort and Quicksort.

Similar presentations

Ads by Google