Merge branch 'main' into patch-1

Author: Aishanipach

BinarySearch

@@ -0,0 +1,36 @@
+def binary_search(arr, x):
+	low = 0
+	high = len(arr) - 1
+	mid = 0
+
+	while low <= high:
+
+		mid = (high + low) // 2
+
+		
+		if arr[mid] < x:
+			low = mid + 1
+
+		
+		elif arr[mid] > x:
+			high = mid - 1
+
+		
+		else:
+			return mid
+
+	
+	return -1
+
+
+# Test array
+arr = [ 1, 10, 15, 20, 30 ]
+x = 20
+
+# Function call
+result = binary_search(arr, x)
+
+if result != -1:
+	print("Element is present at index", str(result))
+else:
+	print("Element is not present in array")

MatrixMultiplier.py

@@ -0,0 +1,19 @@
+
+ 
+# taking a 3x3 matrix
+A = [[12, 7, 3],
+    [4, 5, 6],
+    [7, 8, 9]]
+ 
+# take a 3x4 matrix
+B = [[5, 8, 1, 2],
+    [6, 7, 3, 0],
+    [4, 5, 9, 1]]
+ 
+# result will be 3x4
+result = [[sum(a * b for a, b in zip(A_row, B_col))
+                        for B_col in zip(*B)]
+                                for A_row in A]
+#Now displaying the result
+for r in result:
+    print(r)

README.md

@@ -36,4 +36,13 @@ Feel free to add basic python scripts/programs that helped you learn python. I h
 19. [Insertion Sort](https://github.com/musaibbatghar/Beginners-Python-Projects/blob/main/Insertion_Sort.py) - [Musaib Batghar](https://github.com/musaibbatghar)
 20. [Snake game](https://github.com/Aishanipach/Beginners-Python-Projects/compare/main...meanshkumar:Beginners-Python-Projects:main?expand=1)- [Ansh Kumar](https://github.com/meanshkumar)
 21. [Merge_Sort](https://github.com/proPrateekSahu/Beginners-Python-Projects/blob/main/MergeSort.py) - [Prateek Kumar Sahu](https://github.com/proPrateekSahu)
+
 22. [Binary_Search](https://github.com/proPrateekSahu/Beginners-Python-Projects/blob/main/BinarySearch) - [Prateek Kumar Sahu](https://github.com/proPrateekSahu)
+
+
+23. [Fibonacci_Series](https://github.com/Skillz619/Beginners-Python-Projects/blob/main/fibonacci_series.py) - [Shreekar Kolanu](https://github.com/Skillz619)
+
+24. [Binary_Search](https://github.com/proPrateekSahu/Beginners-Python-Projects/blob/main/BinarySearch) - [Prateek Kumar Sahu](https://github.com/proPrateekSahu)
+25. [TowerOfHoni](https://github.com/proPrateekSahu/Beginners-Python-Projects/blob/main/towerOfHoni.py) - [Prateek Kumar Sahu](https://github.com/proPrateekSahu)
+26. [Matrix_Multiplier](https://github.com/proPrateekSahu/Beginners-Python-Projects/blob/main/MatrixMultiplier.py) - [Prateek Kumar Sahu](https://github.com/proPrateekSahu)
+

fibonacci_series.py

@@ -0,0 +1,27 @@
+# Program to display the Fibonacci sequence up to n-th term
+
+nterms = int(input("How many terms? "))
+
+# first two terms
+n1, n2 = 0, 1
+count = 0
+
+# check if the number of terms is valid
+if nterms <= 0:
+   print("Please enter a positive integer")
+   
+# if there is only one term, return n1
+elif nterms == 1:
+   print("Fibonacci sequence upto",nterms,":")
+   print(n1)
+   
+# generate fibonacci sequence
+else:
+   print("Fibonacci sequence:")
+   while count < nterms:
+       print(n1)
+       nth = n1 + n2
+       # update values
+       n1 = n2
+       n2 = nth
+       count += 1

snake_game.py

@@ -0,0 +1,48 @@
+from random import randrange
+from freegames import square,vector
+
+food=vector(0,0)
+snake=[vector(10,0)]
+aim=vector(0,-10)
+
+def change(x,y):
+    aim.x=x
+    aim.y=y
+
+def inside(head):
+    return -200 < head.x < 190 and -200 < head.y < 190
+
+def move():
+    head=snake[-1].copy()
+    head.move(aim)
+    if not inside(head) or head in snake:
+        square(head.x,head.y,9,"red")
+        update()
+        return
+    snake.append()
+
+    if head==food:
+        print("snake",len(snake))
+        food.x=randrange(-15,15)*10
+        food.y=randrange(-15,15)*10
+    else:
+        snake.pop(0)
+    clear()
+
+    for body in snake:
+        square(body.x,body.y,9,"green")
+
+    square(food.x,food,y,9,"red")
+    update()
+    ontimer(move,100)
+
+    hideturtle()
+    tracer(false)
+    listen()
+    onkey(lambda:changes(10,0),"Right")
+    onkey(lambda:changes(-10,0),"Left")
+    onkey(lambda:changes(0,10),"Up")
+    onkey(lambda:changes(0,-10),"Down")
+
+    move()
+    done()

towerOfHoni.py

@@ -0,0 +1,15 @@
+# Recursive Code
+
+def TowerOfHanoi(n , source, destination, auxiliary):
+	if n==1:
+		print ("Move disk 1 from source",source,"to destination",destination)
+		return
+	TowerOfHanoi(n-1, source, auxiliary, destination)
+	print ("Move disk",n,"from source",source,"to destination",destination)
+	TowerOfHanoi(n-1, auxiliary, destination, source)
+		
+#Test Input
+n = 4
+TowerOfHanoi(n,'A','B','C')
+# Consider A B and C as the names of rods
+