Presentation is loading. Please wait.

Presentation is loading. Please wait.

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,

Published byEliana Tuck Modified over 10 years ago

Similar presentations

Presentation on theme: "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,"— Presentation transcript:

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, last) 4. Merge (list, first, middle, last) endif PROCEDURE MERGE While (L1 not empty) AND (L2 not empty) Compare the next pair of items IF (item from L1) <= (item from L2) Then store item from L1 to newlist and get next item from L1 Else store item from L2 to newlist and get next item from L2 Endif Endwhile If (L1 empty) AND (L2 not empty) then copy items in L2 to Newlist Endif If (L1 not empty) AND (L2 empty) then copy items in L1 to newlist endif

2 23437644 4321 LF 1. Merge_Sort (list, first, last)

3 121 FL 1234 44764323 If (first < last) middle = (first + last) div 2 1 < 4 YES MIDDLE = 1 + 4 = 5 5 DIV 2 = 2 MIDDLE = 2 21 MLF 2. Merge Sort (list, first, middle) 241 MLF 1. Merge Sort (list, first, last) 1 < 2 YES MIDDLE = 1 + 2 = 3 3 DIV 2 = 1 MIDDLE = 1

4 FLM142FLM142 1 2 1 1 44 76 LIST 1 LIST 2 If (first < last) middle = (first + last) div 2 2. Merge Sort (list, first, middle) 3. Merge Sort (list, middle+1, last) 4. Merge (list, first, middle, last) endif 1. PROCEDURE MERGE SORT (list, first, last) FL 1234 44764323 2

5 PROCEDURE MERGE While (L1 not empty) AND (L2 not empty) Compare the next pair of items IF (item from L1) <= (item from L2) Then store item from L1 to newlist and get next item from L1 Else store item from L2 to newlist and get next item from L2 Endif Endwhile If (L1 empty) AND (L2 not empty) then copy items in L2 to Newlist Endif If (L1 not empty) AND (L2 empty) then copy items in L1 to newlist endif 44 76 LIST 1 LIST 2 Newlist 1: 4476

6 FLM142FLM142 1 2 1 1 44 76 3 4 3 3 43 23 LIST 1 LIST 2 LIST 1 LIST 2 2 4 If (first < last) middle = (first + last) div 2 2. Merge Sort (list, first, middle) 3. Merge Sort (list, middle+1, last) 4. Merge (list, first, middle, last) endif 1. PROCEDURE MERGE SORT (list, first, last) FL 1234 44764323

7 PROCEDURE MERGE While (L1 not empty) AND (L2 not empty) Compare the next pair of items IF (item from L1) <= (item from L2) Then store item from L1 to newlist and get next item from L1 Else store item from L2 to newlist and get next item from L2 Endif Endwhile If (L1 empty) AND (L2 not empty) then copy items in L2 to Newlist Endif If (L1 not empty) AND (L2 empty) then copy items in L1 to newlist endif 43 23 LIST 1 LIST 2 Newlist 2: 2343

8 Newlist 2: 2343 Newlist 1: 4476 PROCEDURE MERGE While (L1 not empty) AND (L2 not empty) Compare the next pair of items IF (item from L1) <= (item from L2) Then store item from L1 to newlist and get next item from L1 Else store item from L2 to newlist and get next item from L2 Endif Endwhile If (L1 empty) AND (L2 not empty) then copy items in L2 to Newlist Endif If (L1 not empty) AND (L2 empty) then copy items in L1 to newlist endif NEWLIST 23434476

9 444323 MERGE SORT COMPLETE

Download ppt "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,"

Similar presentations

Recursion Chapter 14. Overview Base case and general case of recursion. A recursion is a method that calls itself. That simplifies the problem. The simpler.

Recursion Chapter 14. Overview Base case and general case of recursion. A recursion is a method that calls itself. That simplifies the problem. The simpler.
Laboratory 4: Hardware Analysis & Synthesis General Engineering Polytechnic University.

Laboratory 4: Hardware Analysis & Synthesis General Engineering Polytechnic University.
Linked List: Traversal Insertion Deletion. Linked List Traversal LB.

Linked List: Traversal Insertion Deletion. Linked List Traversal LB.
Linked Lists Useful when the number of elements is not known in advance or varies widely during execution Allows efficient insertion and removal, sequential.

Linked Lists Useful when the number of elements is not known in advance or varies widely during execution Allows efficient insertion and removal, sequential.
Lecture 6 Sept 11, 2008 Goals for the day: Linked list and project # 1 list class in STL (section 3.3) stack – implementation and applications.

Lecture 6 Sept 11, 2008 Goals for the day: Linked list and project # 1 list class in STL (section 3.3) stack – implementation and applications.
REDESIGNED NETWORK FOR FIRST CLASS MAIL. Duty of Managers/Assistant Superintendents/Head Sorting assistants/Supervisors at Mail Offices/First Class sorting.

REDESIGNED NETWORK FOR FIRST CLASS MAIL. Duty of Managers/Assistant Superintendents/Head Sorting assistants/Supervisors at Mail Offices/First Class sorting.
Variables and References in Python. TAGAGAATTCTA” Objects s Names References >>> s = “TAGAGAATTCTA” >>>

Variables and References in Python. "TAGAGAATTCTA” Objects s Names References >>> s = “TAGAGAATTCTA” >>>
IS 2610: Data Structures Sorting Feb 16, 2004. Sorting Algorithms: Bubble sort Bubble sort  Move through the elements exchanging adjacent pairs if the.

IS 2610: Data Structures Sorting Feb 16, Sorting Algorithms: Bubble sort Bubble sort  Move through the elements exchanging adjacent pairs if the.
Sorting Really Big Files Sorting Part 3. Using K Temporary Files Given  N records in file F  M records will fit into internal memory  Use K temp files,

Sorting Really Big Files Sorting Part 3. Using K Temporary Files Given  N records in file F  M records will fit into internal memory  Use K temp files,
1 40T1 60T2 30T3 10T4 20T5 10T6 60T7 40T8 20T9 R S C C R JOIN S?

1 40T1 60T2 30T3 10T4 20T5 10T6 60T7 40T8 20T9 R S C C R JOIN S?
What else can we do with heaps? Use the heap for sorting. Heapsort!

What else can we do with heaps? Use the heap for sorting. Heapsort!
Binary Search This algorithm is for finding an item in a sorted list or determining that it is not in the list. Is Mr Nosey in the list opposite? This.

Binary Search This algorithm is for finding an item in a sorted list or determining that it is not in the list. Is Mr Nosey in the list opposite? This.
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 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.
COMP 171 Data Structures and Algorithms Tutorial 4 In-Class Exercises: Algorithm Design.

COMP 171 Data Structures and Algorithms Tutorial 4 In-Class Exercises: Algorithm Design.
MergeSort (Example) - 1. MergeSort (Example) - 2.

MergeSort (Example) - 1. MergeSort (Example) - 2.
Text Chapters 1, 2. Sorting ä Sorting Problem: ä Input: A sequence of n numbers ä Output: A permutation (reordering) of the input sequence such that:

Text Chapters 1, 2. Sorting ä Sorting Problem: ä Input: A sequence of n numbers ä Output: A permutation (reordering) of the input sequence such that:
Selection Sort 345012 641532. 345012 6 41532 345012 64 1532.

Selection Sort
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.
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.

Similar presentations

Ads by Google