Merge pull request #155 from saurabhjn76/master

Added some solutions in Java,python  and c

Author: blakeembrey

solutions/c/find-missing-element.c

@@ -0,0 +1,20 @@
+#include <stdio.h>
+#include <stdlib.h>
+// The differnce in sum of two arrays will give us the  desired value.
+// The other approach could be to look up for element each time but that will increase the time complexity of the program.
+ int find_missing(int orig[],int On,int shuffled[])
+{
+	int i,sum=0;
+	for(i=0;i<On-1;i++)
+		sum+=orig[i]-shuffled[i];
+	return sum+orig[On-1];
+}
+
+int main()
+{
+	int arr[]={1,3,5,6,2,5,6,8,9,23,45,67,87};
+	int shuffled_arr[]={1,2,5,6,8,9,3,45,87,6,67,5};
+	int On=sizeof(arr) / sizeof(arr[1]);
+	printf("The missing value is:%d\n",find_missing(arr,On,shuffled_arr));
+	return 0;
+}

solutions/java/FindingMissingElement.java

@@ -0,0 +1,24 @@
+import java.util.*;
+public class FindingMissingElement {
+
+	/**
+	 *The difference in the sum of the two arrays will give us the desired value
+	 */
+	static int find_missing(int a[],int b[])
+	{
+		int sum=0;
+		for(int i:a)
+			sum+=i;
+		for(int i:b)
+			sum-=i;
+	return sum;
+	}
+	public static void main(String[] args) {
+		int[] arr={1,3,5,6,2,5,6,8,9,23,45,67,87};
+		int[] shuffled_ar={1,2,5,6,8,9,3,45,87,6,67,5};
+		System.out.println("The missing value is:"+find_missing(arr,shuffled_ar));
+		
+		
+	}
+
+}

solutions/python/bubble-sort.py

@@ -0,0 +1,13 @@
+
+def bubblesort(lst):
+	for i in range(0,len(lst)-1):
+		for j in range(i+1,len(lst)):
+			if lst[i]>lst[j]:
+				temp=lst[i]
+				lst[i]=lst[j]
+				lst[j]=temp
+	return lst
+	
+l=[1,4,2,4,6,2,6,8,5,8,9,5]
+for i in bubblesort(l):
+	print (i)