adding Sorting Algorithms
package Exercises;

import java.util.*;

public class ChapterOneExercises {
    ChapterOneExercises() {
    }

    //exercise 1.2-2.
    public List<Integer> GapAnalysis() {
        List<Integer> list = new ArrayList<Integer>();
        int n = 2;//just because 2 is right start for n <= 8*log2(n)
        while (n < 8 * (Math.log10(n) / Math.log10(2))) { //or: 2^(n/8) < n
            list.add(n);
            n++;
        }

        System.out.println("\n\nN when time for insertion sort exceed time for merge sort (actual result):\n");
        for (Integer i : list) {
            System.out.print(i + " ");
        }
        System.out.println("\n\n\nAnswer: For value n > " + list.get(list.size() - 1) + " merge sort beats insertion sort");
        return list;
    }

    //exercise 1.2-3.
    public int MinimumValue() {
        int n = 2;// n could be only natural (N+)
        do {
            n++;
        } while ((double) 100 * Math.pow(n, 2.0) >= Math.pow(2, n));
        System.out.println("\n\nValue when first algorithm runs faster " + n + " \n");
        return n;
    }
}
adding new
Remove unusable directory
Remove ide directory
Merge remote-tracking branch 'github/master'