6thCommit

Author: ramgpal

BinarySearch.py

@@ -0,0 +1,16 @@
+def binarySearch(list, key):
+    first = 0
+    last = len(list) - 1
+    while first <= last:  # Changed from 'while(first < last)' to 'while first <= last'
+        mid = (first + last) // 2  # Use floor division '//' to get integer value
+        if list[mid] == key:
+            return mid
+        elif list[mid] < key:
+            first = mid + 1
+        else:
+            last = mid - 1
+    return -1  # Return -1 if the key is not found in the list
+
+list = [1, 2, 3, 4, 5]
+key = 3
+print(binarySearch(list, key))

Fib.py

@@ -0,0 +1,19 @@
+def fibonacci(n):
+    if n <= 0:
+        return "Invalid input. Please provide a positive integer."
+    elif n == 1:
+        return 0
+    elif n == 2:
+        return 1
+    else:
+        return fibonacci(n - 1) + fibonacci(n - 2)
+
+# Input the number of terms for the Fibonacci series
+num_terms = int(input("Enter the number of terms for the Fibonacci series: "))
+
+if num_terms <= 0:
+    print("Please enter a positive integer.")
+else:
+    print("Fibonacci Series:")
+    for i in range(1, num_terms + 1):
+        print(fibonacci(i), end=" ")

Filetr.py

@@ -0,0 +1,6 @@
+def greater(n):
+    if(n > 50):
+        return n
+numbers = [20, 10, 60, 70, 5, 90, 110]
+result = filter(greater, numbers)
+print(list(result))

HOF.py

@@ -0,0 +1,10 @@
+# Higher Order Function - A function can be passed as argument, return as output
+def small(txt):
+    return txt.lower()
+def capital(txt):
+    return txt.upper()
+def all(func):
+    greeting = func("Hi This is Ram, programming for function as an argument")
+    print(greeting)
+all(small)
+all(capital)

LinearSearch.py

@@ -0,0 +1,13 @@
+#LinearSearch
+def linearSearch(list, key):
+    for i in range(len(list)):
+        if (list[i] == key):
+            return True
+        
+    return False
+list = [1, 2, 3, 4, 5]
+key = 4
+if(linearSearch(list, key)):
+    print("Found")
+else:
+    print("Not found")

MapFunction.py

@@ -0,0 +1,10 @@
+# Function to square a number
+def square(x):
+    return x ** 2
+# List of numbers
+numbers = [1, 2, 3, 4, 5]
+# Applying the square function to each element in the numbers list using map()
+squared_numbers = map(square, numbers)
+# Convert the map object to a list to see the results
+squared_numbers_list = list(squared_numbers)
+print(squared_numbers_list)  # Output: [1, 4, 9, 16, 25]

SelectionSort.py

@@ -0,0 +1,15 @@
+def selectionSort(list):
+    for i in range (len(list)-1):
+        tmp = i
+        for j in range(i+1, len(list)):
+            if(list[tmp] > list[j]):
+                tmp = j
+        temp = list[tmp]
+        list[tmp] = list[i]
+        list[i] = temp
+def printList(list):
+    for i in range(len(list)):
+        print(list[i], end=" ")
+list = [9, 6, 2, 5, 8]
+selectionSort(list)
+printList(list)

TOH.py

@@ -1,23 +1,10 @@
-# Tower of Hanoi
-
-def Toh(n, source, destination, medium):
-    if(n == 1):
-        print("Move disk 1 from", source, "to", destination)
+def TowerOfHanoi(n, source, medium, destination):
+    if n == 1:
+        print("Move disc " + str(n) + " from Source: " + source + " to Destination: " + destination)
         return
-    Toh(n-1, source, medium, destination)
-    print("Move disk n from", source, "to", destination)
-    Toh(n-1, destination, source, medium)
-Toh(3, 'A', 'B', 'C')
-
-# def tower_of_hanoi(n, source, destination, auxiliary):
-#     if n == 1:
-#         print("Move disk 1 from", source, "to", destination)
-#         return
-#     tower_of_hanoi(n - 1, source, auxiliary, destination)
-#     print("Move disk", n, "from", source, "to", destination)
-#     tower_of_hanoi(n - 1, auxiliary, destination, source)
-
+    TowerOfHanoi(n-1, source, destination, medium)
+    print("Move disc " + str(n) + " from Source: " + source + " to Destination: " + destination)
+    TowerOfHanoi(n-1, medium, source, destination)
 
-# # Example usage
-# n = 3  # Number of disks
-# tower_of_hanoi(n, 'A', 'C', 'B')
+print("Steps to solve Tower of Hanoi with 3 disks:")
+TowerOfHanoi(3, "A", "B", "C")

mergeSort.py

@@ -0,0 +1,42 @@
+def mergeSort(list, si, ei):
+    if si >= ei:
+        return
+    mid = (si + ei) // 2
+    mergeSort(list, si, mid)
+    mergeSort(list, mid + 1, ei)
+    merge(list, mid, si, ei)
+
+def merge(list, mid, si, ei):
+    temp = []
+    i = si
+    j = mid + 1
+    while i <= mid and j <= ei:
+        if list[i] < list[j]:
+            temp.append(list[i])
+            i += 1
+        else:
+            temp.append(list[j])
+            j += 1
+
+    while i <= mid:
+        temp.append(list[i])
+        i += 1
+
+    while j <= ei:
+        temp.append(list[j])
+        j += 1
+
+    i = si
+    for item in temp:
+        list[i] = item
+        i += 1
+
+def printList(list):
+    for i in range(len(list)):
+        print(list[i], end=" ")
+
+list = [6, 3, 9, 5, 2, 8]
+si = 0
+ei = len(list) - 1
+mergeSort(list, si, ei)
+printList(list)

tempCodeRunnerFile.py

@@ -0,0 +1,2 @@
+elif n == 2:
+    #     return 1