--- /dev/null
+# Sample Makefile to build simple project.
+#
+# This Makefile expect all source files (.c) to be at the same level, in the
+# current working directory.
+#
+# It will automatically generate dependencies, compile all files, and produce a
+# binary using the provided name.
+#
+# Set BINARY_NAME to the name of the binary file to build.
+# Set BUILD_TYPE to either debug or release
+#
+# Automatic dependencies code from:
+# http://make.mad-scientist.net/papers/advanced-auto-dependency-generation/#tldr
+BINARY_NAME=exo1
+BUILD_TYPE=debug
+
+# ====================================
+# DO NOT CHANGE STUFF BEYOND THIS LINE
+# ====================================
+
+all: $(BINARY_NAME)
+
+CC=gcc
+LD=gcc
+
+WARN_FLAGS = -Wall -Wextra
+STD_FLAG = -std=c11
+
+ifeq ($(BUILD_TYPE),debug)
+BUILDDIR := .build/debug
+DEBUG_FLAG = -g
+STRIP_FLAG =
+OPTI_FLAG = -O0
+else
+BUILDDIR := .build/release
+DEBUG_FLAG =
+STRIP_FLAG = -s
+OPTIFLAG = -O3
+endif
+
+CFLAGS := $(CFLAGS) $(WARN_FLAGS) $(STD_FLAG) $(OPTI_FLAG) $(DEBUG_FLAG)
+LDFLAGS := $(LDFLAGS) $(STRIP_FLAG)
+
+OBJDIR := $(BUILDDIR)/objs
+$(shell mkdir -p $(OBJDIR))
+
+SRCS=$(wildcard *.c)
+OBJS=$(patsubst %.c,$(OBJDIR)/%.o,$(SRCS))
+
+DEPDIR := $(BUILDDIR)/deps
+$(shell mkdir -p $(DEPDIR))
+DEPFLAGS = -MT $@ -MMD -MP -MF $(DEPDIR)/$*.Td
+POSTCOMPILE = mv -f $(DEPDIR)/$*.Td $(DEPDIR)/$*.d
+
+$(BINARY_NAME): $(OBJS)
+ @echo "[LD ] $@"
+ @$(LD) $(CFLAGS) $(LDFLAGS) $^ $(LDLIBS) -o $@
+
+$(OBJDIR)/%.o: %.c $(DEPDIR)/%.d
+ @echo "[C ] $*"
+ @$(CC) $(DEPFLAGS) $(CFLAGS) -c $< -o $@
+ @$(POSTCOMPILE)
+
+$(DEPDIR)/%.d: ;
+
+.PRECIOUS: $(DEPDIR)/%.d
+
+include $(wildcard $(patsubst %,$(DEPDIR)/%.d,$(basename $(SRCS))))
+
+clean:
+ @echo "[CLN]"
+ -@rm -r $(BUILDDIR)
+ -@rm $(BINARY_NAME)
+
+disassemble: $(BINARY_NAME)
+ objdump -d $< | less
+
+symbols: $(BINARY_NAME)
+ objdump -t $< | sort | less
--- /dev/null
+#include <stdio.h>
+#include <stdbool.h>
+
+typedef bool(*compare_cb)(int a, int b);
+
+bool ascending(int a, int b) {
+ return a > b;
+}
+
+bool descending(int a, int b) {
+ return a < b;
+}
+
+void swap(int* v1, int* v2) {
+ int tmp = *v1;
+ *v1 = *v2;
+ *v2 = tmp;
+}
+
+void displayArray(int* array, int count) {
+ for (int i = 0; i < count; i++) {
+ printf("Value in array at index[%d]= %d\n", i, array[i]);
+ }
+}
+
+bool sortFirst(int* array, int length, compare_cb compare) {
+ bool rt = false;
+ for (int i = 0; i < length-1; i++) {
+ if (compare(array[i], array[i+1])) {
+ swap(&array[i], &array[i+1]);
+ if (!rt) { rt = true; };
+ }
+ }
+ return rt;
+}
+
+void sortArray(int* array, int length, compare_cb compare) {
+ bool rt;
+ do {
+ rt = sortFirst(array, length, compare);
+ } while (rt);
+}
+
+int main() {
+ const int tab_size = 10;
+ int tab[10] = {4, 6, 2, 9, 5, 7, 1, 3, 8, 0};
+
+ printf("\nView array content unsorted:\n");
+ displayArray(tab, tab_size);
+ printf("\nNow, sorting the array ascending...\n");
+ sortArray(tab, tab_size, ascending);
+ printf("\nView array content sorted:\n");
+ displayArray(tab, tab_size);
+ printf("\nNow, sorting the array descending...\n");
+ sortArray(tab, tab_size, descending);
+ printf("\nView array content sorted:\n");
+ displayArray(tab, tab_size);
+
+ return 0;
+}
do {
rt = sortFirst(array, length);
} while (rt);
-
}
int main() {
printf("\nView array content unsorted:\n");
displayArray(tab, tab_length);
- sortArray(tab, tab_length);
printf("\nNow, sorting the array...\n");
+ sortArray(tab, tab_length);
printf("\nView array content sorted:\n");
displayArray(tab, tab_length);