gitweb on Svarog
projekti pod git sistemom za održavanje verzija -- projects under the git version control system
summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (from parent 1: fe1bfd7)
raw | patch | inline | side by side (from parent 1: fe1bfd7)
author | Doni Pracner <quinnuendo@gmail.com> | |
Sun, 30 Aug 2015 14:15:42 +0000 (16:15 +0200) | ||
committer | Doni Pracner <quinnuendo@gmail.com> | |
Sun, 30 Aug 2015 14:15:42 +0000 (16:15 +0200) |
diff --git a/samples/RekFac.mj b/samples/RekFac.mj
--- a/samples/RekFac.mj
+++ b/samples/RekFac.mj
int factorial(int f)
{
- if (f<0) return 0;
- if (f<=1) return 1;
+ if (f<0)
+ return 0;
+ if (f<=1)
+ return 1;
return factorial(f-1) * f ;
}
diff --git a/samples/RekFib.mj b/samples/RekFib.mj
--- a/samples/RekFib.mj
+++ b/samples/RekFib.mj
int fib(int f)
{
- if (f==0) return 0;
- if (f==1) return 1;
+ if (f==0)
+ return 0;
+ if (f==1)
+ return 1;
return fib(f-2)+fib(f-1) ;
}
diff --git a/samples/div0.mj b/samples/div0.mj
--- a/samples/div0.mj
+++ b/samples/div0.mj
void main()\r
int i, j;\r
{\r
- i = 100; j = 0;\r
+ i = 100; \r
+ j = 0;\r
print(i/j);\r
}\r
\r
diff --git a/samples/div2.mj b/samples/div2.mj
--- a/samples/div2.mj
+++ b/samples/div2.mj
void main()\r
int i, j;\r
{\r
- i = 100; j = 2;\r
+ i = 100; \r
+ j = 2;\r
print(i/j);\r
}\r
\r
diff --git a/samples/eratos.mj b/samples/eratos.mj
--- a/samples/eratos.mj
+++ b/samples/eratos.mj
{\r
void put(int x)\r
{\r
- if (npp == 10) {print(chr(13)); print(chr(10)); npp = 0;}\r
+ if (npp == 10) {\r
+ print(chr(13)); \r
+ print(chr(10)); \r
+ npp = 0;\r
+ }\r
print(x, 5);\r
npp++;\r
}\r
{\r
put(x);\r
i = x;\r
- while (i <= max) {sieve[i] = 'o'; i = i + x;}\r
+ while (i <= max) {\r
+ sieve[i] = 'o'; i = i + x;\r
+ }\r
}\r
\r
void main()\r
npp = 0;\r
sieve = new char[max+1];\r
i = 0;\r
- while (i <= max) {sieve[i] = 'x'; i++;}\r
+ while (i <= max) {\r
+ sieve[i] = 'x'; i++;\r
+ }\r
i = 2;\r
while (i <= max) {\r
found(i);\r
- while(i <= max && sieve[i] == 'o') i++;\r
+ while(i <= max && sieve[i] == 'o') \r
+ i++;\r
}\r
}\r
\r
diff --git a/samples/pos-neg.mj b/samples/pos-neg.mj
--- a/samples/pos-neg.mj
+++ b/samples/pos-neg.mj
int x, i;
{ //---------- Initialize val
val = new Table;
- val.pos = new int[size]; val.neg = new int[size];
+ val.pos = new int[size];
+ val.neg = new int[size];
i = 0;
while (i < size) {
- val.pos[i] = 0; val.neg[i] = 0;
+ val.pos[i] = 0;
+ val.neg[i] = 0;
i++;
}
//---------- Read values