Thursday, April 1, 2021

cpsc 2100 computational complexity,

 Zoom recording, 

// no Breakout room in spring 2021


 * Basic running time types:

 Constant, linear, logliner, quadratic, polynomial, exponential. 

 * Dominant terms in Big O notation (addition and subtractions)

* law of multiplication

Why recursive is exponential? 

 socrative test on linear, log-linear, quadratic etc // converted to Canvas multiple-choice questions


TODO: in unit 13 plot, 

 review computational complexity with plot

 with plotting from unit 13plotting.ipynb. 

# poker cards as an example, organized vs unorganized for search and sort. 



No comments:

Post a Comment