1. Which of the following is the correct syntax for using the bubble sort algorithm in C? a. bubbleSort(int arr[], int n); b. void bubbleSort(int *arr, int n); c. int *bubbleSort(int arr[], int n); d. bubbleSort(int *arr); Answer: b. void bubbleSort(int *arr, int n); 2. Which sorting algorithm has the best average-case time complexity in C? a. Bubble Sort b. Insertion Sort c. Merge Sort d. Selection Sort Answer: c. Merge Sort 3. Which sorting algorithm is not an in-place sorting algorithm in C? a. Bubble Sort b. Heap Sort c. Insertion Sort d. Quick Sort Answer: b. Heap Sort 4. Which of the following is the correct time complexity of the Quick Sort algorithm in C? a. O(n) b. O(nlogn) c. O(n^2) d. O(logn) Answer: b. O(nlogn) 5. Which of the following is an example of a stable sorting algorithm in C? a. Bubble Sort b. Insertion Sort c. Quick Sort d. Shell Sort Answer: b. Insertion 6. Which of the following is not a valid variable type in C? a) int b) float c) char d) decimal Answer: d) d...
Comments
Post a Comment