Initial commit of the book as a pdf and the source codes

Author: NikolayIT

Nakov-Dobrikov-Programming++Algorithms-eBook-10-Feb-2013(1).pdf

@@ -0,0 +1,137 @@
+#define EPS 0.0001
+#define MAX_LEN 100
+
+#include <assert.h>
+#include <math.h>
+#include <stdio.h>
+#include <string.h>
+
+char getChar(char n) /* Âðúùà ñèìâîëà, ñúîòâåòñòâàù íà n */
+{  return (n < 10) ? n + '0' : n + 'A' - 10; }
+
+char getValue(char c) /* Âðúùà ñòîéíîñòòà íà ñèìâîëà c */
+{  return (c >= '0' && c <= '9') ? c - '0' : c - 'A' + 10; }
+
+void reverse(char *pch)
+{ char *pEnd;
+  for (pEnd = pch + strlen(pch) - 1; pch < pEnd; pch++, pEnd--) {
+	char c = *pch;
+	*pch = *pEnd;
+	*pEnd = c;
+  }
+}
+
+void convert(char *rslt, unsigned long n, unsigned char base)
+/* Ïðåîáðàçóâà öÿëîòî äåñåòè÷íî ÷èñëî n (n >= 0) â áðîéíà ñèñòåìà ñ îñíîâà base */
+{ char *saveRslt = rslt;
+  while (n > 0) {
+	*rslt++ = getChar((char)(n % base));
+	n /= base;
+  }
+  *rslt = '\0';
+  reverse(saveRslt);
+}
+
+void convertLessThan1(char *rslt, double n, unsigned char base, unsigned char cnt)
+/* Ïðåîáðàçóâà äåñåòè÷íîòî ÷èñëî 0 <= n < 1 â áðîéíà ñèñòåìà ñ îñíîâà base
+   ñ íå ïîâå÷å îò cnt íà áðîé öèôðè ñëåä äåñåòè÷íàòà çàïåòàÿ */
+{ 
+  while (cnt--) {
+    /* Äàëè íå ñìå ïîëó÷èëè 0? */
+	if (fabs(n) < EPS) break;
+	/* Ïîëó÷àâàíå íà ñëåäâàùàòà öèôðà */
+    n *= base;
+	*rslt++ = getChar((char)(int)floor(n));
+    n -= floor(n);
+  }
+  *rslt = '\0';
+}
+
+void convertReal(char *rslt, double n, unsigned char base, unsigned char cnt)
+  /* Ïðåîáðàçóâà äåñåòè÷íîòî ðåàëíî ÷èñëî n â áðîéíà ñèñòåìà ñ îñíîâà base */
+{ double integer, fraction;
+
+  /* Íàìèðàíå íà çíàêà */
+  if (n < 0) {
+	*rslt++ = '-';
+	n = -n;
+  }
+
+  /* Ðàçáèâàíå íà öÿëà è äðîáíà ÷àñò */
+  fraction = modf(n, &integer); 
+
+  /* Êîíâåðòèðàíå íà öÿëàòà ÷àñò */
+  convert(rslt, (unsigned long)integer, base);
+
+  /* Ïîñòàâÿíå íà äåñåòè÷íà òî÷êà */
+  if ('\0' == *rslt)
+	*rslt++ = '0';
+  else
+	rslt += strlen(rslt);
+  *rslt++ = '.';
+
+  /* Êîíâåðòèðàíå íà äðîáíàòà ÷àñò */
+  convertLessThan1(rslt, fraction, base, cnt);
+  if ('\0' == *rslt) {
+	*rslt++ = '0';
+	*rslt = '\0';
+  }
+}
+
+unsigned long calculate(const char *numb, unsigned char base)
+/* Íàìèðà äåñåòè÷íàòà ñòîéíîñò íà ÷èñëîòî numb, çàäàäåíî â áðîéíà ñèñòåìà
+    ñ îñíîâà base, numb >= 0 */
+{ unsigned long result;
+  for (result = 0; '\0' != *numb; numb++)
+    result = result*base + getValue(*numb);
+  return result;
+}
+
+double calculateLessThan1(const char *numb, unsigned char base)
+/* Íàìèðà äåñåòè÷íàòà ñòîéíîñò íà ÷èñëîòî numb (0 < numb < 1),
+   çàäàäåíî â áðîéíà ñèñòåìà ñ îñíîâà base */
+{ const char *end;
+  double result;
+  for (end = numb + strlen(numb) - 1, result = 0.0; end >= numb; end--)
+    result = (result + getValue(*end)) / base;
+  return result;
+}
+
+double calculateReal(char *numb, unsigned char base)
+/* Íàìèðà äåñåòè÷íàòà ñòîéíîñò íà ðåàëíîòî ÷èñëî numb, çàäàäåíî
+   â áðîéíà ñèñòåìà ñ îñíîâà base */
+{ char *pointPos;
+  char minus;
+  double result;
+
+  /* Ïðîâåðêà çà ìèíóñ */
+  if ('-' == *numb) {
+	minus = -1;
+	numb++;
+  }
+  else
+	minus = 1;
+
+  if (NULL == (pointPos = strchr(numb, '.')))
+    return calculate(numb, base); /* Íÿìà äðîáíà ÷àñò */
+  
+  /* Ïðåñìÿòàíå íà öÿëàòà ÷àñò */
+  *pointPos = '\0';
+  result = calculate(numb, base);
+  *pointPos = '.';
+
+  /* Ïðèáàâÿíå íà äðîáíàòà ÷àñò */
+  result += calculateLessThan1(pointPos+1, base);
+
+  return minus*result;
+
+}
+
+int main(void) {
+  char numb[MAX_LEN];
+  printf("!!! Äåìîíñòðàöèÿ íà ïðåîáðàçóâàíåòî ìåæäó áðîéíè ñèñòåìè !!!\n");
+  convertReal(numb, 777.777, 7, 10); printf("Ñåäìè÷íèÿò çàïèñ íà 777.777 (10) å %s\n", numb);
+  strcpy(numb,"11.D873");
+  printf("Äåñåòè÷íèÿò çàïèñ íà 11.D873 (16) å: %0.10lf\n",calculateReal(numb,16));
+  return 0;
+}

sources/chapter01/base.c

@@ -0,0 +1,29 @@
+#include <stdio.h>
+
+#define MAXN 100
+
+const unsigned long n = 10;
+
+unsigned long M[MAXN+1];
+void stirling(unsigned n)
+{ unsigned i, j;
+  if (n == 0) M[0] = 1;
+    else M[0] = 0;
+  for (i = 1; i <= n; i++) {
+    M[i] = 1;
+    for (j = i - 1; j >= 1; j--) M[j] = j * M[j] + M[j - 1];
+  }
+}
+
+unsigned long bell(unsigned n)
+{ unsigned i;
+  unsigned long result = 0;
+  for (i = 0; i <= n; i++) result += M[i];
+  return result;
+}
+
+int main(void) {
+  stirling(n);
+  printf("bell(%lu)= %lu\n", n, bell(n));
+  return 0;
+}

sources/chapter01/bell.c

@@ -0,0 +1,48 @@
+#include <stdio.h>
+
+#define MAXN 500
+
+unsigned long n = 7;
+unsigned long k = 3;
+
+unsigned long pN, primes[MAXN], counts[MAXN];
+
+void modify(long int x, int how)
+{ unsigned i;
+  for (i = 0; i < pN; i++)
+    if (x == primes[i]) { counts[i] += how; return; }
+  counts[pN] = how;
+  primes[pN++] = x;
+}
+
+void solve(unsigned long start, unsigned long end, unsigned long inc)
+{ unsigned long prime, mul, how, i, max;
+  for (i = start; i <= end; i++) {
+    mul = i;
+    prime = 2;
+    while (mul != 1) {
+      for (how = 0; mul % prime == 0; mul /= prime, how++);
+      if (how > 0) modify(prime, inc * how);
+      prime++;
+    }
+  }
+}
+
+long int calc(void)
+{ int i, j;
+  long int result = 1;
+  for (i = 0; i < pN; i++)
+    for (j = 0; j < counts[i]; j++) result *= primes[i];
+  return result;
+}
+
+int main(void) {
+  printf("C(%lu,%lu)= ", n, k);
+  pN = 0;
+  if (n - k < k) k = n - k;
+  solve(n - k + 1, n, 1); /* Ôàêòîðèçèðà ÷èñëèòåëÿ (n–k+1),...,n */
+  solve(1, k, -1);        /* Ôàêòîðèçèðà çíàìåíàòåëÿ 1,...,k */
+  printf("%lu\n", calc());
+  return 0;
+}
+

sources/chapter01/cnk.c

@@ -0,0 +1,49 @@
+#include <stdio.h>
+
+#define MAXN 100
+
+const unsigned n = 6;
+const unsigned perm[MAXN] = { 5, 3, 6, 4, 2, 1 };
+const unsigned long code = 551;
+
+unsigned long codePerm(unsigned n, unsigned perm[])
+{ unsigned p[MAXN], i, pos;
+  unsigned long r, result;
+  result = 0;
+  for (i = 0; i < n; i++) p[i] = i + 1;
+  for (pos = 0; pos < n; pos++) {
+    r = 0;
+    while (perm[pos] != p[r]) r++;
+    result = result * (n - pos) + r;
+    for (i = r + 1; i < n; i++) p[i - 1] = p[i];
+  }
+  return result;
+}
+
+void decodePerm(unsigned long num, unsigned n, unsigned perm[])
+{ unsigned long r, m, k;
+  unsigned i, p[MAXN];
+  for (i = 0; i < n; i++) p[i] = i + 1;
+  k = n;
+  do {
+    m = n - k + 1;
+    perm[k - 1] = num % m;
+    if (k > 1) num /= m;
+  } while (--k > 0);
+  k = 0;
+  do {
+    m = perm[k]; perm[k] = p[m];
+    if (k < n)
+      for (i = m + 1; i < n; i++) p[i - 1] = p[i];
+  } while (++k < n);
+}
+
+int main(void) {
+  unsigned i;
+  printf("Äàäåíàòà ïåðìóòàöèÿ ñå êîäèðà êàòî %lu \n", codePerm(n, perm));
+  printf("Äåêîäèðàìå ïåðìóòàöèÿòà îòãîâàðÿùà íà ÷èñëîòî %lu: ", code);
+  decodePerm(code, n, perm);
+  for (i = 0; i < n; i++) printf("%u ", perm[i]);
+  printf("\n");
+  return 0;
+}

sources/chapter01/codeperm.c

@@ -0,0 +1,33 @@
+#include <stdio.h>
+
+/* comment */
+#define MAXN 20
+
+/* Íàìèðà âñè÷êè êîìáèíàöèè íà n åëåìåíòà îò k-òè êëàñ */
+const unsigned n = 5;
+const unsigned k = 3;
+
+unsigned mp[MAXN];
+
+void print(unsigned length)
+{ unsigned i;
+  for (i = 0; i < length; i++) printf("%u ", mp[i]);
+  printf("\n");
+}
+
+void komb(unsigned i, unsigned after)
+{ unsigned j;
+  if (i > k) return;
+  for (j = after + 1; j <= n; j++) {
+    mp[i - 1] = j;
+    if (i == k) print(i);
+    komb(i + 1, j);
+  }
+}
+
+int main(void) {
+  printf("C(%u,%u): \n", n, k);
+  komb(1, 0);
+  return 0;
+}
+

sources/chapter01/comb.c

@@ -0,0 +1,35 @@
+#include <stdio.h>
+
+#define MAXN 100
+
+const unsigned n = 7;
+
+unsigned mp[MAXN + 1];
+
+void print(unsigned length)
+{ unsigned i;
+  for (i = 1; i < length; i++) printf("%u+", mp[i]);
+  printf("%u\n", mp[length]);
+}
+
+void devNum(unsigned n, unsigned pos)
+{ unsigned k;
+  for (k = n; k >= 1; k--) {
+    if (n != k) {
+      mp[pos] = k;
+      if (mp[pos] <= mp[pos - 1]) {
+        devNum(n - k, pos + 1);
+      }
+    }
+    else {
+      mp[pos] = k;
+      if (mp[pos] <= mp[pos - 1]) print(pos);
+    }
+  }
+}
+
+int main(void) {
+  mp[0] = n+1;
+  devNum(n, 1);
+  return 0;
+}

sources/chapter01/devnum.c

@@ -0,0 +1,36 @@
+#include <stdio.h>
+
+/* Ìàêñèìàëåí áðîé íà ìíîæèòåëèòå, íàé-ìíîãî log2n (ìèíèìàëíèÿò å 2). */
+#define MAXLN 20
+
+/* ×èñëî, êîåòî ùå ðàçáèðàìå */
+const unsigned n = 50;
+
+unsigned mp[MAXLN];
+
+void print(unsigned length)
+{ unsigned i;
+  for (i = 1; i < length; i++) printf("%u * ", mp[i]);
+  printf("%d\n", mp[length]);
+}
+
+void devNum(unsigned n, unsigned pos)
+{ unsigned k;
+  for (k = n; k > 1; k--) {
+    if (n != k) {
+      mp[pos] = k;
+      if (mp[pos] <= mp[pos - 1])
+        if (n % k == 0) devNum(n / k, pos + 1);
+    }
+    else {
+      mp[pos] = k;
+      if (mp[pos] <= mp[pos - 1]) print(pos);
+    }
+  }
+}
+
+int main(void) {
+  mp[0] = n + 1;
+  devNum(n, 1);
+  return 0;
+}