Bogosort. What is it!? 👩‍💻 Bogosort is a highly inefficient sorting algorithm that works by shuffling an array randomly until it happens to be in sorted order. It has a worst-case time complexity of O(n!), which means that as the size of the array grows, the time it takes to sort it increases exponentially. In other words, it's a fun algorithm to think about and play with, but not practical for real-world use. #algorithm #software #technology #bogosort

Big O and Time Complexity - explained