WGU C949 - Data Structure and Algorithm, Questions and answers, VERIFIED. 2024/25

WGU C949 - Data Structure and Algorithm, Questions and answers, VERIFIED. What is the Big O Time Complexity of Selection Sort O(n^2) What is the Big O Time Complexity of Insertion Sort O(n^2) What is the Big O Time Complexity of Bubble Sort O(n^2) What is the Big O Time Complexity of Merge Sort O(n log n) What is the Big O Time Complexity of Quick Sort O(n log n) What is the Big O Time Complexity of Heap Sort O(n log n) What is the Big O Time Complexity of Radix Sort O(nk), where k is the number of digits in the largest number in the array. __________ is a way to describe the upper bound of how an algorithm's running time or space requirements grow as the input size increases. Big-O notation If the number of steps stays the same no matter how large the input size is, the time complexity is constant and represented by O(1). Examples include accessing an element in an array or performing a simple arithmetic operation. Constant Time Complexity If an algorithm goes through a long list linearly, the time complexity is proportional to the input size and represented by O(n). Examples include traversing a linked list or array.