Some Stuff

Author: nishantc1527

README.md

@@ -1,8 +1,6 @@
 # Algorithms
 
-A collection of common algorithms and data structures with source code in Java, C++, and Python.
-
-If you want to view the Java source code, go to java.md. If you want to view the Python source code, go to python.md, and same for C++ except go to cpp.md.
+A collection of common algorithms and data structures with source code in Java.
 
 # Gradle
 

src/main/java/bitmanipulation/problems/missingnumber/MissingNumber.java

@@ -2,14 +2,21 @@
 
 public class MissingNumber {
 
+  /**
+   * Given an array nums containing n distinct numbers in the range [0, n], return the only number
+   * in the range that is missing from the array.
+   *
+   * @param arr Array of numbers.
+   * @return The single number that is missing from the array.
+   */
   public static int missingNumber(int[] arr) {
-    int XOR = 0;
+    int xor = 0;
 
     for (int i = 0; i < arr.length; i++) {
-      XOR ^= i ^ arr[i];
+      xor ^= i ^ arr[i];
     }
 
-    return XOR ^ arr.length;
+    return xor ^ arr.length;
   }
 
   public static void main(String[] args) {

src/main/java/bitmanipulation/problems/singlenumber/SingleNumber.java

@@ -2,6 +2,14 @@
 
 public class SingleNumber {
 
+  /**
+   * Given a non-empty array of integers nums, every element appears twice except for one. Find that
+   * single one. You must implement a solution in linear runtime complexity and use only constant
+   * extra space.
+   *
+   * @param arr Array of integers.
+   * @return The element that only appears once.
+   */
   public static int singleNumber(int[] arr) {
     int xor = 0;
 

src/main/java/datastructures/unionfind/UnionFind.java

@@ -78,8 +78,8 @@ public boolean sameGroup(int element1, int element2) {
    * @return True if the {@link UnionFind} is path compressed.
    */
   public boolean isPathCompressed() {
-    for (int j : parent) {
-      if (j != parent[j]) {
+    for (int i = 0; i < parent.length; i++) {
+      if (parent[i] != parent[parent[i]]) {
         return false;
       }
     }

src/main/java/graphtheory/shortestpathalgorithms/singlesource/dijkstrasshortestpath/DijkstrasShortestPath.java

@@ -1,6 +1,6 @@
 package graphtheory.shortestpathalgorithms.singlesource.dijkstrasshortestpath;
 
-import datastructures.minpriorityqueue.MinHeap.MinHeap;
+import datastructures.minpriorityqueue.minheap.MinHeap;
 import java.util.Arrays;
 import java.util.Comparator;
 import java.util.LinkedList;

src/main/java/math/vectors/Vector3.java

@@ -70,7 +70,8 @@ public double dotProduct(final Vector3 other) {
   }
 
   public Vector3 crossProduct(final Vector3 other) {
-    return new Vector3(y * other.z - z * other.y, z * other.x - x * other.z, x * other.y - y * other.x);
+    return new Vector3(
+        y * other.z - z * other.y, z * other.x - x * other.z, x * other.y - y * other.x);
   }
 
   public double norm() {

src/test/java/datastructures/minpriorityqueue/FibonacciHeapTest.java

@@ -2,7 +2,7 @@
 
 import static org.junit.jupiter.api.Assertions.*;
 
-import datastructures.minpriorityqueue.FibonacciHeap.FibonacciHeap;
+import datastructures.minpriorityqueue.fibonacciheap.FibonacciHeap;
 import java.util.Arrays;
 import org.junit.jupiter.api.Disabled;
 import org.junit.jupiter.api.Test;

src/test/java/datastructures/minpriorityqueue/MinHeapTest.java

@@ -2,7 +2,7 @@
 
 import static org.junit.jupiter.api.Assertions.*;
 
-import datastructures.minpriorityqueue.MinHeap.MinHeap;
+import datastructures.minpriorityqueue.minheap.MinHeap;
 import java.util.Arrays;
 import java.util.HashSet;
 import java.util.PriorityQueue;