完善代码

工具库/不重复随机数.c

@@ -13,6 +13,8 @@ static inline void swap(int *left, int *right)
 
 void random(int array[], size_t size)
 {
+	if (array == NULL)
+		return;
 	for (size_t index = 0; index < size; ++index)
 		array[index] = index + 1;
 	for (size_t index = 0; index < size; ++index)

算法/二分查找.c

@@ -2,6 +2,8 @@
 
 int bsearch(const int array[], int size, int key)
 {
+	if (array == NULL)
+		return -1;
 	int low = 0, high = size - 1, mid;
 	while (low <= high)
 	{
@@ -17,7 +19,7 @@ int bsearch(const int array[], int size, int key)
 	return -1;
 }
 
-#define N 9
+#define N 10
 
 int main()
 {

算法/分解因数.c

@@ -2,7 +2,7 @@
 
 size_t factor(unsigned integer, unsigned factors[], size_t size)
 {
-	if (size == 0)
+	if (factors == NULL || size == 0)
 		return 0;
 	size_t counter = 0;
 	for (unsigned factor = 2; factor <= integer; ++factor)

算法/排序/冒泡排序.c

@@ -11,7 +11,7 @@ static inline void swap(int *left, int *right)
 
 void sort(int array[], size_t size)
 {
-	if (size == 0)
+	if (array == NULL || size == 0)
 		return;
 	for (size_t i = size - 1, j; i > 0; --i)
 		for (j = 0; j < i; ++j)

算法/排序/插入排序.c

@@ -2,6 +2,8 @@
 
 void sort(int array[], int size)
 {
+	if (array == NULL)
+		return;
 	for (int i, j = 1, key; j < size; ++j)
 	{
 		key = array[j];
@@ -24,6 +26,7 @@ int main()
 	for (int i = 0; i < N; ++i)
 		scanf("%d", &array[i]);
 	sort(array, N);
+	printf("排序之后：");
 	for (int i = 0; i < N; ++i)
 		printf("%d ", array[i]);
 	puts("\b");

算法/排序/选择排序.c

+#include<stdio.h>
+
+static inline void swap(int *left, int *right)
+{
+	if (left == right)
+		return;
+	int temp = *left;
+	*left = *right;
+	*right = temp;
+}
+
+void sort(int array[], size_t size)
+{
+	if (array == NULL)
+		return;
+	for (size_t i = size, j, k; i > 0; --i)
+	{
+		for (j = 1, k = 0; j < i; ++j)
+			if (array[k] < array[j])
+				k = j;
+		swap(array + k, array + j - 1);
+	}
+}
+
+#define N 10
+
+int main()
+{
+	int array[N];
+	printf("输入%d个整数：", N);
+	for (int i = 0; i < N; ++i)
+		scanf("%d", &array[i]);
+	sort(array, N);
+	printf("排序之后：");
+	for (int i = 0; i < N; ++i)
+		printf("%d ", array[i]);
+	puts("\b");
+	return 0;
+}