fibonacci search, bucket sort and PCA code added (issue #7)

python/searching/Fibonacci Search.py

@@ -0,0 +1,63 @@
+
+from bisect import bisect_left 
+
+def fibMonaccianSearch(arr, x, n): 
+
+	fibMMm2 = 0 # (m-2)'th Fibonacci No. 
+	fibMMm1 = 1 # (m-1)'th Fibonacci No. 
+	fibM = fibMMm2 + fibMMm1 # m'th Fibonacci 
+
+	# fibM is going to store the smallest 
+	# Fibonacci Number greater than or equal to n 
+	while (fibM < n): 
+		fibMMm2 = fibMMm1 
+		fibMMm1 = fibM 
+		fibM = fibMMm2 + fibMMm1 
+
+	# Marks the eliminated range from front 
+	offset = -1; 
+
+	# while there are elements to be inspected. 
+	# Note that we compare arr[fibMm2] with x. 
+	# When fibM becomes 1, fibMm2 becomes 0 
+	while (fibM > 1): 
+
+		# Check if fibMm2 is a valid location 
+		i = min(offset+fibMMm2, n-1) 
+
+		# If x is greater than the value at 
+		# index fibMm2, cut the subarray array 
+		# from offset to i 
+		if (arr[i] < x): 
+			fibM = fibMMm1 
+			fibMMm1 = fibMMm2 
+			fibMMm2 = fibM - fibMMm1 
+			offset = i 
+
+		# If x is less than the value at 
+		# index fibMm2, cut the subarray 
+		# after i+1 
+		elif (arr[i] > x): 
+			fibM = fibMMm2 
+			fibMMm1 = fibMMm1 - fibMMm2 
+			fibMMm2 = fibM - fibMMm1 
+
+		# element found. return index 
+		else : 
+			return i 
+
+	# comparing the last element with x */ 
+	if(fibMMm1 and arr[offset+1] == x): 
+		return offset+1; 
+
+	# element not found. return -1 
+	return -1
+
+arr = [10, 22, 35, 40, 45, 50, 
+	80, 82, 85, 90, 100] 
+n = len(arr) 
+x = 85
+print("Found at index:", 
+	fibMonaccianSearch(arr, x, n)) 
+
+# This code is contributed by rishabh_jain 

python/sorting/Bucket sort.py

@@ -0,0 +1,44 @@
+# Python3 program to sort an array 
+# using bucket sort 
+def insertionSort(b): 
+	for i in range(1, len(b)): 
+		up = b[i] 
+		j = i - 1
+		while j >= 0 and b[j] > up: 
+			b[j + 1] = b[j] 
+			j -= 1
+		b[j + 1] = up	 
+	return b	 
+
+def bucketSort(x): 
+	arr = [] 
+	slot_num = 10 # 10 means 10 slots, each 
+				# slot's size is 0.1 
+	for i in range(slot_num): 
+		arr.append([]) 
+
+	# Put array elements in different buckets 
+	for j in x: 
+		index_b = int(slot_num * j) 
+		arr[index_b].append(j) 
+
+	# Sort individual buckets 
+	for i in range(slot_num): 
+		arr[i] = insertionSort(arr[i]) 
+
+	# concatenate the result 
+	k = 0
+	for i in range(slot_num): 
+		for j in range(len(arr[i])): 
+			x[k] = arr[i][j] 
+			k += 1
+	return x 
+
+# Driver Code 
+x = [0.897, 0.565, 0.656, 
+	0.1234, 0.665, 0.3434] 
+print("Sorted Array is") 
+print(bucketSort(x)) 
+
+# This code is contributed by 
+# Oneil Hsiao