class_1.pdf - Introduction to algorithms Insertion sort...

Info icon This preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction to algorithms Insertion sort Asymptotic notations Decision-trees and complexity Divide and conquer Merge sort Recurrence relations and the master theorem Introduction to algorithms July 4, 2017
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Introduction to algorithms Insertion sort Asymptotic notations Decision-trees and complexity Divide and conquer Merge sort Recurrence relations and the master theorem Overview 1 Insertion sort 2 Asymptotic notations 3 Decision-trees and complexity 4 Divide and conquer Merge sort Recurrence relations and the master theorem
Image of page 2
Introduction to algorithms Insertion sort Asymptotic notations Decision-trees and complexity Divide and conquer Merge sort Recurrence relations and the master theorem The sorting problem Notations: We denote the set { 1 , 2 , 3 , ..., n } by [ n ]. We denote the set of all permutations of [ n ] by S n (this is actually a group). Given a sequence of real numbers a = ( a 1 , a 2 , ..., a n ) we would like to reorder them from the smallest to the largest. The Sorting problem: Given a sequence of (different) real numbers a = ( a 1 , a 2 , ..., a n ), find the (unique) permutation π S n such that: a π (1) a π (2) ... a π ( n )
Image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Introduction to algorithms Insertion sort Asymptotic notations Decision-trees and complexity Divide and conquer Merge sort Recurrence relations and the master theorem The sorting problem Notations: We denote the set { 1 , 2 , 3 , ..., n } by [ n ]. We denote the set of all permutations of [ n ] by S n (this is actually a group). Given a sequence of real numbers a = ( a 1 , a 2 , ..., a n ) we would like to reorder them from the smallest to the largest. The Sorting problem: Given a sequence of (different) real numbers a = ( a 1 , a 2 , ..., a n ), find the (unique) permutation π S n such that: a π (1) a π (2) ... a π ( n )
Image of page 4
Introduction to algorithms Insertion sort Asymptotic notations Decision-trees and complexity Divide and conquer Merge sort Recurrence relations and the master theorem The sorting problem Notations: We denote the set { 1 , 2 , 3 , ..., n } by [ n ]. We denote the set of all permutations of [ n ] by S n (this is actually a group). Given a sequence of real numbers a = ( a 1 , a 2 , ..., a n ) we would like to reorder them from the smallest to the largest. The Sorting problem: Given a sequence of (different) real numbers a = ( a 1 , a 2 , ..., a n ), find the (unique) permutation π S n such that: a π (1) a π (2) ... a π ( n )
Image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Introduction to algorithms Insertion sort Asymptotic notations Decision-trees and complexity Divide and conquer Merge sort Recurrence relations and the master theorem The sorting problem We will consider sorting algorithms that uses only comparisons (and not algebraic properties of numbers for example). Such algorithms do not assume anything other then the existence of an order relation so they can be applied for objects other than numbers. We will take a brief look at algorithms that use other properties and see the differences.
Image of page 6
Introduction to algorithms Insertion sort Asymptotic notations Decision-trees and complexity Divide and conquer Merge sort Recurrence relations and the master theorem The sorting problem
Image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern