Post by Andry Rakotonjanabelo

cs big real world case study: prove/disprove 1a: the time complexity to find a restroom 🚻 in a Macy's store is O(n), where n is the size of the given store. prove/disprove 1b: the time complexity jumps to O(n!) when you're actually in a rush and are looking for one :) is this true?