添加Makefile自动化构建

Author: jungor

Makefile

@@ -0,0 +1,36 @@
+#IDIR =.
+#CC=gcc
+#CFLAGS=-I$(IDIR)
+
+#ODIR=obj
+#LDIR =../lib
+
+#LIBS=-lm
+
+_DEPS = utils.h
+#DEPS = $(patsubst %,$(IDIR)/%,$(_DEPS))
+DEPS = $(_DEPS)
+
+BIN = main
+
+_OBJ = $(BIN).c utils.c $(subst ./, ,$(wildcard ./chap*/*.c))
+#OBJ = $(patsubst %.c,$(ODIR)/%.o,$(_OBJ))
+OBJ = $(patsubst %.c, %.o, $(_OBJ))
+
+$(BIN): $(OBJ)
+	$(CC) -o $@ $^ $(CFLAGS) $(LIBS)
+
+#$(BIN).o: main.c $(DEPS)
+#	$(CC) -c -o $@ $< $(CFLAGS)
+
+%.o: %.c %.h $(DEPS)
+	$(CC) -c -o $@ $< $(CFLAGS)
+
+.PHONY: clean run
+
+run:
+	./$(BIN)
+
+clean:
+	#rm -f $(ODIR)/*.o *~ core $(INCDIR)/*~ 
+	rm -f $(OBJ) $(BIN)

chap02/merge_sort.c

@@ -4,6 +4,7 @@
  */
 #include <limits.h>
 #include <stdlib.h>
+#include "../utils.h"
 void merge_sort(int nums[], int len) {
     if (len == 1) return;
     int mid = len/2;

chap06/heap_sort.c

@@ -5,6 +5,7 @@
 
 #include "heap_sort.h"
 #include <limits.h>
+#include "../utils.h"
 /**
  * 维护堆的性质
  * 前置条件：i的左右子树都已经是最大堆
@@ -24,9 +25,7 @@ void max_heapify(int nums[], int heap_size, int i) {
         max = r;
     }
     if (max != i) {
-        int tmp = nums[i];
-        nums[i] = nums[max];
-        nums[max] = tmp;
+        swap(nums, i, max);
         max_heapify(nums, heap_size, max);
     }
 }

chap07/quick_sort.c

@@ -4,15 +4,25 @@
  */
 
 #include "quick_sort.h"
+#include "../utils.h"
 
-int partition(int nums[], int len) {
-    int small_top = -1;
-    int key = nums[len-1];
-    for (int i = 0; i < len; i++) {
-        if ()
+int partition(int nums[], int begin, int end) {
+    int small_top = begin;
+    int key = nums[end-1];
+    for (int i = begin; i < end; i++) {
+        if (nums[i] < key) {
+            swap(nums, small_top, i);
+            small_top++;
+        }
     }
+    swap(nums, small_top, end-1);
+    return small_top;
 }
 
-void quick_sort(int nums[], int len) {
-
+void quick_sort(int nums[], int begin, int end) {
+    if (begin < end) {
+        int p = partition(nums, begin, end);
+        quick_sort(nums, begin, p);
+        quick_sort(nums, p+1, end);
+    }
 }

chap07/quick_sort.h

@@ -1,6 +1,6 @@
 #ifndef QUICK_SORT_H
 #define QUICK_SORT_H
 
-void quick_sort(int nums[], int len);
+void quick_sort(int nums[], int begin, int end);
 
 #endif

main.c

@@ -3,12 +3,14 @@
 #include "chap02/merge_sort.h"
 #include "chap04/maximum_subarray.h"
 #include "chap06/heap_sort.h"
+#include "chap07/quick_sort.h"
 #include <stdio.h>
 
 int main() {
     //int nums[] = {13,-3,-25,20,-3,-16,-23,18,20,-7,12,-5,-22,15,-4,7};
     int nums[] = {1, 0, 4, 3, 7, 6, 5, 2, 9, 8};
-    heap_sort(nums, 10);
+    print_array(nums, 10);
+    quick_sort(nums, 0, 10);
     // subarr sa = maximum_subarray(nums, 0, 4);
     print_array(nums, 10);
     //printf("left: %d, right: %d, sum: %d\n", sa.left, sa.right, sa.sum);

utils.c

@@ -16,3 +16,10 @@ void print_array(int nums[], int len) {
     }
     printf("]\n");
 }
+
+void swap(int nums[], int a, int b) {
+    if (a == b) return;
+    int tmp = nums[a];
+    nums[a] = nums[b];
+    nums[b] = tmp;
+}

utils.h

@@ -2,5 +2,5 @@
 #define UTILS_H
 
 void print_array(int nums[], int len);
-
+void swap(int nums[], int a, int b);
 #endif