Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. With this skill, you can get help with time and space complexity of common sorting algorithms.
To start the conversation with Alexa, say, Alexa, open Big O Notation. After that, you can ask questions about the following sorting algorithms: - Quicksort - Mergesort - Timsort - Heapsort - Bubble Sort - Insertion Sort - Selection Sort - Tree Sort - Bucket Sort - Radix Sort - Counting Sort - Cubesort
“Alexa, ask Big O Notation what is time complexity of Quicksort”