cs 330 algorithms pre quiz summary n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
CS 330: Algorithms Pre-Quiz Summary PowerPoint Presentation
Download Presentation
CS 330: Algorithms Pre-Quiz Summary

Loading in 2 Seconds...

play fullscreen
1 / 8

CS 330: Algorithms Pre-Quiz Summary - PowerPoint PPT Presentation


  • 101 Views
  • Uploaded on

CS 330: Algorithms Pre-Quiz Summary. Gene Itkis. Summary. Analysis of Algorithms O, o, , ,  Correctness proofs Invariants Recurrence Relations Master method Specific algorithms General approaches/techniques. Specific Algorithms. Sorting Selection Insertion [Bubble] Mergesort

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'CS 330: Algorithms Pre-Quiz Summary' - gage-gutierrez


Download Now An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
summary
Summary
  • Analysis of Algorithms
    • O, o, , , 
    • Correctness proofs
      • Invariants
    • Recurrence Relations
      • Master method
  • Specific algorithms
  • General approaches/techniques

Gene Itkis

specific algorithms
Specific Algorithms
  • Sorting
    • Selection
    • Insertion
    • [Bubble]
    • Mergesort
    • QuickSort
      • Randomized
    • PQ-sort
      • 2-Heaps
      • Leftist Heaps

Gene Itkis

specific algorithms1
Specific Algorithms
  • Sorting (continued)
    • Special sorting algorithms
        • Each makes special assumption on the input!!!
      • Radix
      • Bucket
      • Counting
    • Lower bounds
      • Comparison-only sorting algorithms: (n lg n)

Gene Itkis

specific algorithms2
Specific Algorithms
  • Order statistic
    • QuickSelect

Gene Itkis

techniques approaches
Techniques/Approaches
  • Greedy
    • Selection and Insertion sorts
  • Divide & Concur
    • Merge and Quick sorts
    • Binary search
  • “Data Structure”
    • PQ-sort

Gene Itkis

performance
Performance
  • Worst case
  • Best case
  • Expected
    • Probability distribution on inputs
    • Probability distribution on internal coin-flips
  • Randomized vs. deterministic algorithms
  • Special assumptions on input

Gene Itkis

slide8
Quiz
  • NEXT CLASS
  • Closed book
  • 1 page crib sheet
  • Good luck!

Gene Itkis