Any

C programs/Duplicates in O(n)time.c

@@ -0,0 +1,27 @@
+// C code to find
+// duplicates in O(n) time
+#include <stdio.h>
+#include <stdlib.h>
+
+// Function to print duplicates
+void printRepeating(int arr[], int size)
+{
+	int i;
+	printf("The repeating elements are: \n");
+	for (i = 0; i < size; i++) {
+		if (arr[abs(arr[i])] >= 0)
+			arr[abs(arr[i])] = -arr[abs(arr[i])];
+		else
+			printf(" %d ", abs(arr[i]));
+	}
+}
+
+// Driver Code
+int main()
+{
+	int arr[] = { 1, 2, 3, 1, 3, 6, 6 };
+	int arr_size = sizeof(arr) / sizeof(arr[0]);
+	printRepeating(arr, arr_size);
+	getchar();
+	return 0;
+}

PythonPrograms/Selection Sort.py

@@ -0,0 +1,23 @@
+# Python program for implementation of Selection
+# Sort
+import sys
+A = [64, 25, 12, 22, 11]
+
+# Traverse through all array elements
+for i in range(len(A)):
+
+	# Find the minimum element in remaining
+	# unsorted array
+	min_idx = i
+	for j in range(i+1, len(A)):
+		if A[min_idx] > A[j]:
+			min_idx = j
+
+	# Swap the found minimum element with
+	# the first element	
+	A[i], A[min_idx] = A[min_idx], A[i]
+
+# Driver code to test above
+print ("Sorted array")
+for i in range(len(A)):
+	print("%d" %A[i]),