Tuesday, April 6, 2021

cpsc2100 sorting algorithm

utc course evaluation


Poker example with video recording? (Poker card does not have zero, I used Joker card instead). 

Power point example? 

For selection sort, my poker card demo and Python output are not consistent, likely due to the implementation of the inner loop. 

I used bisection search as a reverse analogy for merge-sort. However, bisection search is O(log2(n)), but merge-sort has O( n log2(n)) 



 




No comments:

Post a Comment