Added last three homeworks

2025.02.28/Example/compare.c

@@ -0,0 +1,18 @@
+#include "compare.h"
+
+int up_strcmp(const char *a, const char *b)
+{ return strcmp(a, b); }
+
+int down_strcmp(const char *a, const char *b)
+{ return strcmp(b, a); }
+
+int up_len(const char *a, const char *b)
+{
+	ssize_t diff = (ssize_t)strlen(a) - (ssize_t)strlen(b);
+	if (diff < 0) return -1;
+	if (diff > 0) return 1;
+	return up_strcmp(a, b);
+}
+
+int down_len(const char *a, const char *b)
+{ return up_len(b, a); }

2025.02.28/Example/compare.h

@@ -0,0 +1,9 @@
+#ifndef COMPARE_H
+#define COMPARE_H
+
+int up_strcmp(const char *a, const char *b);
+int down_strcmp(const char *a, const char *b);
+int up_len(const char *a, const char *b);
+int down_len(const char *a, const char *b);
+
+#endif

2025.02.28/Example/main.c

@@ -0,0 +1,52 @@
+int main(int argc, char *argv[])
+{
+	/* ./aout c n p a.txt */
+	int c, p, n;
+	char *name;
+	int (*cmp)(const char *, const char *);
+	int (*f[])(const char *, const char *) = {up_strcmp, down_strcmp, up_len, down_len};
+	int len_f = sizeof(f) / sizeof(f[0]);
+
+	if (!(argc == 5 && sscanf(argv[2]. "%d", &n) == 1 && sscanf(argv[3], "%d" &p) == 1 && c >= 1 && c <= len_f))
+	{
+		printf("Usage %s c n p name\n", argv[0]);
+		return 1;
+	}
+	name = argv[4];
+	cmp = f[c-1];
+
+	if (!(a = (char **)malloc(n * sizeof(char *))))
+	{
+		printf("Not enough memory: \n");
+		return 2;
+	}
+	ret = read_array(a, n, name);
+
+	do {
+		switch(ret)
+		{
+			case SUCCESS:
+				continue;
+			case ERROR_OPEN:
+				printf("Cannot open %s\n", name);
+				break;
+			case ERROR_READ:
+				printf("Cannot read %s\n", name);
+				break;
+		}
+
+			free(a);
+			return 3;
+	} while (0);
+	
+	print_array(a, n, p);
+	t = clock();
+	sort(a, n, cmp);
+	t = (clock() - t) / CLOCKS_PER_SEC;
+	print_array(a, n, p);
+	
+	delete_array(a, n);
+	free(a);
+
+	return 0;
+}

2025.02.28/Example/solve.c

@@ -0,0 +1,13 @@
+#include "solve.h"
+
+int check(char **a, int n, int (*cmp)(const char *, const char *))
+{
+	/* Каждый элемент больше следующего */
+	int i; int count = 0;
+	for (i = 1; i < n; i++)
+	{
+		if ((*cmp)(a[i-1], a[i]) > 0)
+			count++;
+	}
+	return count;
+}

2025.02.28/Example/sort.h

@@ -0,0 +1,6 @@
+#ifndef SORT_H
+#define SORT_H
+
+void sort(char **a, int n, int (*cmp)(const char *, const char *));
+
+#endif