User Tools

Site Tools


cs320:topics1

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
cs320:topics1 [2020/08/19 10:32]
scarl
cs320:topics1 [2020/09/20 18:32] (current)
scarl
Line 2: Line 2:
  
 ^ Topics ^^^ ^ Topics ^^^
-|**Mergesort**|TBD|Present proof of correctness from CLRS Section 2.3 and runtime complexity from DPV Ch. 2 using the Master Theorem | +|**Mergesort**|Thomas Broadnax and Julia Harvey|Present proof of correctness from CLRS Section 2.3 and runtime complexity from DPV Ch. 2 using the Master Theorem ​
-|**Finding Medians**|TBD|Present algorithm with example and runtime complexity from DPV Section 2.4| +|**Maximum Subarray** |Jack Li and Dirk Kayitare| Present algorithm with example and runtime analysis from CLRS Section 4.1
-|**Matrix Multiplication** |TBD| Present "brute force algorithm"​ from CLRS Chapter 4; then Strassen'​s algorithm and runtime complexity from DPV Chapter 2.5+|**Finding Medians**|Cody Johnson and Calid Shorter|Present algorithm with example and runtime complexity from DPV Section 2.4| 
-|**Maximum Subarray** |TBD| Present algorithm with example and runtime analysis from CLRS Section 4.1|+|**Matrix Multiplication** |NOT ASSIGNED| Present "brute force algorithm"​ from CLRS Chapter 4; then Strassen'​s algorithm and runtime complexity from DPV Chapter 2.5|
cs320/topics1.txt · Last modified: 2020/09/20 18:32 by scarl