Add files via upload

Author: eemustafasahin

JavaAppLesson006/org/csystem/app/App.java

@@ -0,0 +1,37 @@
+/*----------------------------------------------------------------------------------------------------------------------
+    Sınıf Çalışması: Klavyeden alınan gün, ay ve yıl bilgilerine göre kişinin doğum günü geçmişse
+    "geçmiş doğum gününü kutlu olsun", o an doğum günü ise "doğum gününüz kutlu olsun", doğum henüz gelmemişse
+    "doğum gününüz şimdiden kutlu olsun" mesajlarından birini ekrana basan programı Calendar sınıfını kullanarak yazınız
+----------------------------------------------------------------------------------------------------------------------*/
+package org.csystem.app;
+
+import org.csystem.util.Console;
+
+import java.util.Calendar;
+
+class App {
+    public static void main(String[] args)
+    {
+        Calendar now = Calendar.getInstance();
+
+        Console.writeLine("%02d/%02d/%04d %02d:%02d:%02d.%03d",
+                now.get(Calendar.DAY_OF_MONTH),
+                now.get(Calendar.MONTH) + 1,
+                now.get(Calendar.YEAR),
+                now.get(Calendar.HOUR_OF_DAY),
+                now.get(Calendar.MINUTE),
+                now.get(Calendar.SECOND),
+                now.get(Calendar.MILLISECOND));
+
+        now.set(Calendar.HOUR_OF_DAY, 10);
+
+        Console.writeLine("%02d/%02d/%04d %02d:%02d:%02d.%03d",
+                now.get(Calendar.DAY_OF_MONTH),
+                now.get(Calendar.MONTH) + 1,
+                now.get(Calendar.YEAR),
+                now.get(Calendar.HOUR_OF_DAY),
+                now.get(Calendar.MINUTE),
+                now.get(Calendar.SECOND),
+                now.get(Calendar.MILLISECOND));
+    }
+}

JavaAppLesson006/org/csystem/samples/recurison/RecursionUtil.java

@@ -0,0 +1,104 @@
+package org.csystem.samples.recurison;
+
+public class RecursionUtil {
+    private static int getFibonacciNumberRecur(int n)
+    {
+        if (n <= 2)
+            return n - 1;
+
+        return getFibonacciNumberRecur(n - 1) + getFibonacciNumberRecur(n - 2);
+    }
+
+    private static void getReverse(char [] c, int left, int right)
+    {
+        if (left >= right)
+            return;
+
+        char temp;
+
+        temp = c[left];
+        c[left] = c[right];
+        c[right] = temp;
+
+        getReverse(c, left + 1, right - 1);
+    }
+
+    private static void writeNumberRecur(int val)
+    {
+        if (val / 10 != 0)
+            writeNumber(val / 10);
+
+        System.out.write((char)(val % 10 + '0'));
+    }
+
+    private static void writeNumberRecur(int val, int radix)
+    {
+        if (val / radix != 0)
+            writeNumberRecur(val / radix, radix);
+
+        //System.out.write((char)(val % radix >= 10 ? val % radix - 10 + 'A' : val % radix + '0'));
+        System.out.write((char)((val % radix >= 10 ? - 10 + 'A' : '0') + val % radix));
+    }
+
+    private static void writeReverse(String s, int i)
+    {
+        if (i == s.length())
+            return;
+
+        writeReverse(s, i + 1);
+        System.out.write(s.charAt(i));
+    }
+
+    public static long factorial(int n)
+    {
+        if (n <= 0)
+            return 1;
+
+        return n * factorial(n - 1);
+    }
+
+    public static int getFibonacciNumber(int n)
+    {
+        if (n <= 0)
+            return -1;
+
+        return getFibonacciNumberRecur(n);
+    }
+
+    public static String getReverse(String s)
+    {
+        char [] c = s.toCharArray();
+
+        getReverse(c, 0, c.length - 1);
+
+        return String.valueOf(c);
+    }
+
+    public static void writeNumber(int val)
+    {
+        if (val < 0) {
+            System.out.write('-');
+            val = -val;
+        }
+        writeNumberRecur(val);
+        System.out.flush();
+    }
+
+    public static void writeNumber(int val, int radix)
+    {
+        if (val < 0) {
+            System.out.write('-');
+            val = -val;
+        }
+
+        writeNumberRecur(val, radix);
+        System.out.flush();
+    }
+
+    public static void writeReverse(String s)
+    {
+        writeReverse(s, 0);
+        System.out.flush();
+    }
+
+}

JavaAppLesson006/org/csystem/samples/recurison/Util.java

@@ -0,0 +1,76 @@
+package org.csystem.samples.recurison;
+
+public class Util {
+
+    public static long factorial(int n)
+    {
+        long result = 1;
+
+        for (; n > 1; --n)
+            result *= n;
+
+        return result;
+    }
+
+    public static int getFibonacciNumber(int n)
+    {
+        if (n <= 0)
+            return -1;
+
+        if (n <= 2)
+            return  n - 1;
+
+        int prev1 = 0, prev2 = 1, val = 0;
+
+        for (int i = 2; i < n; ++i) {
+            val = prev1 + prev2;
+            prev1 = prev2;
+            prev2 = val;
+        }
+
+        return val;
+    }
+
+    public static String getReverse(String s)
+    {
+        return new StringBuilder(s).reverse().toString();
+    }
+
+    public static void writeNumber(int val)
+    {
+        if (val == 0) {
+            System.out.write('0');
+            return;
+        }
+
+        char [] s = new char[11];
+        int i;
+        boolean isNegative;
+        isNegative = false;
+
+        if (val < 0) {
+            isNegative = true;
+            val = -val;
+        }
+
+        for (i = 0; val != 0; ++i) {
+            s[i] = (char)(val % 10 + '0');
+            val /= 10;
+        }
+        if (isNegative)
+            s[i++] = '-';
+
+        for (--i; i >= 0; --i)
+            System.out.write(s[i]);
+
+        System.out.flush();
+    }
+
+    public static void writeReverse(String s)
+    {
+        for (int i = s.length() - 1; i >= 0; --i)
+            System.out.write(s.charAt(i));
+
+        System.out.flush();
+    }
+}