@DunningsBooger @nosoundstars @guy5678588@TheRightCant you literally gave a response under 2 minutes.. don't you have anything else to do other than browsing twitter and posting stupid ass images all day long?
@AleksejsIvanovs@skoarkid@fermatslibrary it scales linearly with the input size, we aren't supposed to care about the k because it has nothing to do with the input size.
@fatihkcansu@QuantaMagazine coppersmith-winograd algorithm is not the fastest. it's the one that has the best asymptotic complexity. it runs in O(n^2.4) time but the constant in the big o notation is so big that it's impossible to use the algorithm in practice.
@AleksejsIvanovs@skoarkid@fermatslibrary radix sort is not the same thing as bucket sort, also both of them scale linearly by the input size. so radix sort. has O(kn) complexity where k is the number of digits of the numbers and it's O(n+k) for counting sort where k is the range of. the numbers. does that make sense?
@AleksejsIvanovs@skoarkid@fermatslibrary only for comparison sorts, whom has the O(n log n) lower limit, however if you're working with only nuibers then it is possible to sort in O(n) time using algorithms like bucket or radix sort.