Java code

Author: alized559

Ints.txt

@@ -0,0 +1,14 @@
+82384 
+204 435 
+22 31 12 
+999 483 
+28350 28345 39823 95689 234856 3482 55328 934803 
+7849323789 22398496 8940    32489 859320
+729348690234239     542890432323 534322343298 
+3948692348692348693486235  5834938349234856234863423 
+999999999999999999999999    432432 58903 34 
+82934 49802390432  8554389   4789432789   0 48372934287 
+0 
+0 0 0 
+7482343 0   4879023     0 8943242
+3333333333   4723  3333333333 6642 3333333333

MyIntsCollection.java

@@ -0,0 +1,79 @@
+import java.util.Arrays;
+
+public class MyIntsCollection {
+  private MyInt[] myInts;
+
+  // constructor
+  public MyIntsCollection(MyInt[] integers) {
+    this.myInts = integers;
+  }
+
+  // empty constructor
+  public MyIntsCollection() {
+    this.myInts = new MyInt[1];
+  }
+
+  // This method sort the array of MyInts
+  public MyInt[] sort(boolean isAsc) {
+    MyInt[] sortedMyInts = Arrays.copyOf(this.myInts, this.myInts.length);
+    int compareKey = isAsc ? +1 : -1;
+    for (int i = 0; i < sortedMyInts.length - 1; i++) {
+      for (int j = 1; j < sortedMyInts.length - i; j++) {
+        if (sortedMyInts[j - 1].compareTo(sortedMyInts[j]) == compareKey) {
+          // swap
+          MyInt temp = sortedMyInts[j - 1];
+          sortedMyInts[j - 1] = sortedMyInts[j];
+          sortedMyInts[j] = temp;
+        }
+      }
+    }
+    return sortedMyInts;
+  }
+
+  // This method returns the index of MyInt in the array
+  public int indexOf(MyInt other) {
+    for (int i = 0; i < this.myInts.length; i++) {
+      if (this.myInts[i].isEqual(other))
+        return i;
+    }
+    return -1;
+  }
+
+  // This method add element to the array
+  public void append(MyInt other) {
+    if (this.myInts[0] == null) {
+      this.myInts[0] = other;
+    } else {
+      MyInt[] newArray = new MyInt[this.myInts.length + 1];
+      for (int i = 0; i < this.myInts.length; i++)
+        newArray[i] = this.myInts[i];
+      newArray[this.myInts.length] = other;
+      this.myInts = newArray;
+    }
+  }
+
+  // This method sum MyInts
+  public MyInt sumAll() {
+    MyInt sum = new MyInt("0");
+    for (int i = 0; i < this.myInts.length; i++)
+      sum = sum.add(this.myInts[i]);
+    return sum;
+  }
+
+  public String toString() {
+    String str = "";
+    for (int i = 0; i < this.myInts.length; i++)
+      str += this.myInts[i].toString() + "\n";
+    return str;
+  }
+
+  public static void main(String[] args) {
+    MyInt[] a = {new MyInt("23"), new MyInt("16"), new MyInt("51")};
+    MyIntsCollection collection = new MyIntsCollection(a);
+    MyInt[] sortedArray = collection.sort(false);
+    System.out.println(Arrays.toString(a));
+    System.out.println("sorted array: " + Arrays.toString(sortedArray));
+    System.out.println("index of 51: " + collection.indexOf(new MyInt("51")));
+    System.out.println("sum = " + collection.sumAll());
+  }
+}

SumAndSort.java

@@ -0,0 +1,26 @@
+import java.util.Scanner;
+import java.io.File;
+import java.io.FileNotFoundException;
+
+public class SumAndSort {
+  public static void main(String[] args) throws FileNotFoundException {
+    File file = new File("Ints.txt");
+    sumInts(file);
+  }
+
+  // This method sum all the MyInts in the collection
+  public static void sumInts(File file) throws FileNotFoundException {
+    Scanner readFromFile = new Scanner(file);
+    MyIntsCollection collection = new MyIntsCollection();
+    while (readFromFile.hasNextLine()) {
+      String line = readFromFile.nextLine();
+      Scanner readFromLine = new Scanner(line);
+      while (readFromLine.hasNext()) {
+        MyInt num = new MyInt(readFromLine.next());
+        collection.append(num);
+      }
+      System.out.println(collection.sumAll());
+      collection = new MyIntsCollection();
+    }
+  }
+}