Added Diffie Key exchange

Author: 0xbrayo

ciphers/diffieHellmanKeyExchange.go

@@ -18,42 +18,42 @@ func main(){
 
 	p:=2+rand.Intn(1<<bit)
 	g:=2+rand.Intn(5)
-	
+
 	//Both parties choose a secret key
-	
+
 	AliceSecret := 1 + rand.Intn(1<<bit)
 	BobSecret := 1 + rand.Intn(1<<bit)
-	
-	fmt.Printf("Alice's secret key is: %v",AliceSecret)
-	fmt.Printf("Bob's secret key is: %v",BobSecret)
-	
-	//Both parties send ((g^secret_key)%p) 
+
+	fmt.Printf("Alice's secret key is: %v\n",AliceSecret)
+	fmt.Printf("Bob's secret key is: %v\n",BobSecret)
+
+	//Both parties send ((g^secret_key)%p)
 	//It's not possible to determine the secretkey from the value sent
-	
+
 	AliceSends :=modularExponentiation(g,AliceSecret,p)
 	BobSends :=modularExponentiation(g,BobSecret,p)
 
-	fmt.Printf("Alice sends to Bob: %v",AliceSends)
-	fmt.Printf("Bob sends to Alice: %v",BobSends)
+	fmt.Printf("Alice sends to Bob: %v\n",AliceSends)
+	fmt.Printf("Bob sends to Alice: %v\n",BobSends)
 
 	//Both parties calculate the shared secret key from the value send
 	//(value_sent^secret_key)%p
 	//Both calculations end up with same value despite the different inputs
 	AliceComputes :=modularExponentiation(BobSends,AliceSecret,p)
 	BobComputes := modularExponentiation(AliceSends,BobSecret,p)
 
-	fmt.Printf("Alice Computes the shared secret key as: %v",AliceComputes)
-	fmt.Printf("Bob Computes the shared secret key as: %v",BobComputes)
-	
+	fmt.Printf("Alice Computes the shared secret key as: %v\n",AliceComputes)
+	fmt.Printf("Bob Computes the shared secret key as: %v\n",BobComputes)
+
 	// simply confirms that the values are equal
 	if AliceComputes == BobComputes{
 		sharedKey:=AliceComputes
-		fmt.Println(" Voila, shared key is",sharedKey)
+		fmt.Println("Voila, shared key is ",sharedKey)
 	}
 
-	
 
-	
+
+
 }
 func modularExponentiation(b int, e int, mod int)int{
 	//runs in O(log(n)) where n = e

other/NestedBrackets.go

@@ -7,6 +7,7 @@
 // For example, the string "()()[()]" is properly nested but "[(()]" is not.
 // The function called isBalanced takes as input a string which is a sequence of brackets and
 // returns true if input is nested and false otherwise.
+//note that only an even number of brackets can be properly nested
 
 package main
 
@@ -18,7 +19,9 @@ import (
 )
 
 func isBalanced(input string) string {
-
+/*	if len(input)%2 == 0{
+		return input + "is not balanced."
+	}*/
 	if len(input) > 0 {
 		var stack []byte
 		for i := 0; i < len(input); i++ {

searches/binary_search.go

@@ -1,35 +1,35 @@
-/*
-	Binary search implementation in Go
-*/
-package main
-
-func binarySearch(array []int, target int, lowIndex int, highIndex int) int {
-	if highIndex < lowIndex {
-		return -1
-	}
-	mid := int((lowIndex + highIndex) / 2)
-	if array[mid] > target {
-		return binarySearch(array, target, lowIndex, mid)
-	} else if array[mid] < target {
-		return binarySearch(array, target, mid+1, highIndex)
-	} else {
-		return mid
-	}
-}
-
-func iterBinarySearch(array []int, target int, lowIndex int, highIndex int) int {
-	startIndex := lowIndex
-	endIndex := highIndex
-	var mid int
-	for startIndex < endIndex {
-		mid = int((startIndex + endIndex) / 2)
-		if array[mid] > target {
-			endIndex = mid
-		} else if array[mid] < target {
-			startIndex = mid
-		} else {
-			return mid
-		}
-	}
-	return -1
-}
+/*
+	Binary search implementation in Go
+*/
+package main
+
+func binarySearch(array []int, target int, lowIndex int, highIndex int) int {
+	if highIndex < lowIndex {
+		return -1
+	}
+	mid := int((lowIndex + (highIndex-lowindex)/2))
+	if array[mid] > target {
+		return binarySearch(array, target, lowIndex, mid)
+	} else if array[mid] < target {
+		return binarySearch(array, target, mid+1, highIndex)
+	} else {
+		return mid
+	}
+}
+
+func iterBinarySearch(array []int, target int, lowIndex int, highIndex int) int {
+	startIndex := lowIndex
+	endIndex := highIndex
+	var mid int
+	for startIndex < endIndex {
+		mid = int((startIndex + (endIndex-startIndex)/2))
+		if array[mid] > target {
+			endIndex = mid
+		} else if array[mid] < target {
+			startIndex = mid
+		} else {
+			return mid
+		}
+	}
+	return -1
+}