Merge branch 'master' into master

Author: SubCoder1

Contributor.md

@@ -7,6 +7,7 @@ This is a repo created to remember the Hacktober Fest organized by Github, Digit
 * [Your Name](http://yourgithuburl) | [Your School/Uni](https://www.youruniurl/)
 * [Saurav Jaiswal](https://github.com/sauravjaiswalsj) | [Sathyabama Institute of Science and Technology](http://www.sathyabama.ac.in/)
 * [Foxxy](https://github.com/foxxydev) | ["Aurel Vlaicu" University of Arad](http://www.uav.ro)
+* [Tejas Tank](https://github.com/majordwarf) | [Thakur College of Science and Commerce](http://tcsc.org.in/)
 
 
 

README.md

@@ -1,4 +1,4 @@
-## Welcome to the SCC-SIST-Algorithms
+## Welcome to the Algorithms-Hacktoberfest by Fnplus
 
 This repository is a part of [ HacktoberFest -an event organised by DigitalOcean ](https://hacktoberfest.digitalocean.com/). 
 You are requested to create your profile using the above link to be a part of it.
@@ -39,6 +39,7 @@ This repository contains examples of various algorithms written on different pro
 | C               | <pre>gcc [filename.c]<br>./a.out  # unix<br>a.exe  # windows</pre>     |
 | CPP             | <pre>g++ [filename.cpp]<br>./a.out # unix<br>a.exe # windows</pre>     |
 | Java            | <pre>javac [filename.java]<br>java [filename]</pre>                    |
+| golang          | <pre>go build [filename.go]<br>[./filename]</pre>                     |
 
 
 ## Contributing

binary_search/clang/binary_search.c

@@ -1 +1 @@
-//add your code here
+//add your code here

binary_search/cpp/binary_search.cpp

@@ -1,2 +1 @@
-// add your code here
-
+// add your code here

binary_search/java/binary_search.java

@@ -1 +1,21 @@
-// add your code here :
+/**
+* Returns index of value in values array or -1 if array doesn't contain specified element 
+* @param values array with integers to search in
+* @param value integer value to search in values
+* @param start first index of array to search in
+* @param end last index of array to search in 
+*/
+public int binary_search(int [] values, int value, int start, int end) {
+  if(end >= 1) {
+    int middle = (start+end)/2;
+    if(values[middle] == value)
+      return middle; 
+
+    if (values[middle] > value) 
+      return binary_search(values, value, start, middle-1); 
+    else 
+      return binary_search(values, value, middle+1, end);
+  }
+
+  return -1;
+}

binary_search/python/binary_search.py

@@ -1 +1 @@
-# add your code here
+# add your code here

counting_sort/cpp/counting_sort.cpp

@@ -1 +1,54 @@
-//add your code here
+/* Created by SubCoder1 on 31-May-18.
+
+     Sorting Technique -- Counting Sort
+     Input             -- A sequence of n numbers
+     Output            -- Reordered into a definite sequence {Ascending(HERE)}
+
+     Time Complexity :-
+        Worst Case - O(N^2)
+        Best  Case - O(N + RANGE)
+ */
+
+
+
+
+
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <chrono>
+
+ using namespace std::chrono;
+ using namespace std;
+
+int main(){
+    int inpt;
+    vector<int> store;
+    vector<int>:: iterator it;
+
+    cout << "Unsorted Input -- ";
+    while(cin.peek() != '\n'){
+        cin >> inpt;
+        store.push_back(inpt);
+    }
+    
+    auto start = high_resolution_clock::now();
+
+    it = max_element(store.begin(), store.end());
+    int range = *it;
+    vector<int> aux(range, 0);
+
+    for(auto i: store){ aux[i-1]+=1; }
+
+    cout << "Sorted Output -- ";
+    for(int i = 0; i < range; i++){
+        for(int j = 1; j <= aux[i]; j++){
+            cout << i+1 << " ";
+        }
+    }
+
+    auto end = high_resolution_clock::now();
+
+    cout << "Time Elapsed -- " << duration_cast<microseconds>(end - start).count() << " microS.\n";
+
+}

fibnocii/clang/fibnocii.c renamed to fibonacci/clang/fibonacci.c

@@ -0,0 +1,10 @@
+package golang
+
+func fib(n int) []int {
+	seq := []int{1, 1}
+	for len(seq) < n {
+		i := len(seq)
+		seq = append(seq, seq[i-1]+seq[i-2])
+	}
+	return seq[:n]
+}

fibnocii/cpp/fibnocii.cpp renamed to fibonacci/cpp/fibonacci.cpp

@@ -0,0 +1,40 @@
+package golang
+
+import (
+	"reflect"
+	"testing"
+)
+
+func Test_fib(t *testing.T) {
+	type args struct {
+		n int
+	}
+	tests := []struct {
+		name string
+		args args
+		want []int
+	}{
+		{
+			name: "Passing 0 as the args",
+			args: args{n: 0},
+			want: []int{},
+		},
+		{
+			name: "Passign legit number",
+			args: args{n: 2},
+			want: []int{1, 1},
+		},
+		{
+			name: "Passign legit number",
+			args: args{n: 5},
+			want: []int{1, 1, 2, 3, 5},
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := fib(tt.args.n); !reflect.DeepEqual(got, tt.want) {
+				t.Errorf("fib() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}

fibonacci/golang/fibonacci.go

@@ -0,0 +1,14 @@
+def fib(n):
+    sequence = [1, 1]
+    while (len(sequence) < n):
+        i = len(sequence)
+        sequence.append(
+            sequence[i-1] +
+            sequence[i-2]
+        )
+
+    return sequence[:n]
+
+# fib(2) -> [1, 1]
+# fib(5) -> [1, 1, 2, 3, 5]
+# fib(10) -> [1, 1, 2, 3, 5, 8, 13, 21, 34, 55]

fibonacci/golang/fibonacci_test.go

@@ -1 +1,51 @@
-// add your code here :
+public class MergeSort {
+        private static int[] exArray;
+    public static void sort(int[] arrayToSort){
+        exArray = new int[arrayToSort.length];
+        mergeSort(arrayToSort,0,arrayToSort.length-1);
+    }
+
+    private static void mergeSort(int[]array,int leftIndex,int rightIndex){
+        if(leftIndex<rightIndex)
+        {
+            int middleIndex = (leftIndex+rightIndex)/2;
+            mergeSort(array,leftIndex,middleIndex);
+            mergeSort(array,middleIndex+1,rightIndex);
+            merge(array,leftIndex,middleIndex,rightIndex);
+        }
+    }
+    private static void  merge(int[]array,int leftIndex,int middleIndex, int rightindex){
+        for(int i=leftIndex;i<=rightindex;i++)
+        {
+            exArray[i]=array[i];
+        }
+
+        int pointer1 = leftIndex;
+        int pointer2 = middleIndex+1;
+        int current = leftIndex;
+        while(pointer1 <= middleIndex && pointer2<=rightindex)
+        {
+            Main.iterationCounter++;
+            if(exArray[pointer1]<=exArray[pointer2])
+            {
+                array[current] = exArray[pointer1];
+                pointer1++;
+            }
+            else
+            {
+
+                array[current] = exArray[pointer2];
+                pointer2++;
+            }
+            current++;
+        }
+        while(pointer1<= middleIndex){
+            array[current] = exArray[pointer1];
+            pointer1++;
+            current++;
+
+        }
+
+    }
+
+}