Friday, December 1, 2023 3:30 pm
-
3:30 pm
EST (GMT -05:00)
Tutte Colloquium - Samuel Jaques
Title: Wires, bits, and the cost of sorting
Speaker: | Samuel Jaques |
Affiliation: | University of Waterloo |
Location: | MC 5501 |
Abstract: How hard is it to sort a list of n integers? A basic course on algorithms says it's O(n log n) time, but what if the list is enormous - so big you would need to cover the surface of the moon just to store it?