C语言双精度数组排序（冒泡排序）及时间复杂度分析

"""#include "stdio.h"\n\nvoid bubbleSort(double nums[], int n) {\n\t\tint i, j;\n\t\tfor (i = 0; i < n-1; i++) {\n\t\t\tfor (j = 0; j < n-i-1; j++) {\n\t\t\t\tif (nums[j] > nums[j+1]) {\n\t\t\t\t\tdouble temp = nums[j];\n\t\t\t\t\tnums[j] = nums[j+1];\n\t\t\t\t\tnums[j+1] = temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n}\n\nint main() {\n\tdouble nums[] = {2.3, 1.5, 4.7, 3.2, 0.8};\n\tint n = sizeof(nums) / sizeof(nums[0]);\n\n\tbubbleSort(nums, n);\n\n\tprintf("Sorted array: ");\n\tfor (int i = 0; i < n; i++) {\n\t\tprintf("%0.1f ", nums[i]);\n\t}\n\n\treturn 0;\n}\n"""\n这里使用的是冒泡排序算法，时间复杂度为 O(n^2)。