Spaces:
Running
Running
Create programming.txt
Browse files- programming.txt +53 -0
programming.txt
ADDED
|
@@ -0,0 +1,53 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
def hello_world():
|
| 2 |
+
print("Hello, World!")
|
| 3 |
+
return True
|
| 4 |
+
|
| 5 |
+
def fibonacci(n):
|
| 6 |
+
if n <= 1:
|
| 7 |
+
return n
|
| 8 |
+
return fibonacci(n-1) + fibonacci(n-2)
|
| 9 |
+
|
| 10 |
+
def factorial(n):
|
| 11 |
+
if n == 0:
|
| 12 |
+
return 1
|
| 13 |
+
return n * factorial(n-1)
|
| 14 |
+
|
| 15 |
+
class Calculator:
|
| 16 |
+
def __init__(self):
|
| 17 |
+
self.result = 0
|
| 18 |
+
|
| 19 |
+
def add(self, a, b):
|
| 20 |
+
return a + b
|
| 21 |
+
|
| 22 |
+
def subtract(self, a, b):
|
| 23 |
+
return a - b
|
| 24 |
+
|
| 25 |
+
def bubble_sort(arr):
|
| 26 |
+
n = len(arr)
|
| 27 |
+
for i in range(n):
|
| 28 |
+
for j in range(0, n-i-1):
|
| 29 |
+
if arr[j] > arr[j+1]:
|
| 30 |
+
arr[j], arr[j+1] = arr[j+1], arr[j]
|
| 31 |
+
return arr
|
| 32 |
+
|
| 33 |
+
def binary_search(arr, target):
|
| 34 |
+
left, right = 0, len(arr) - 1
|
| 35 |
+
while left <= right:
|
| 36 |
+
mid = (left + right) // 2
|
| 37 |
+
if arr[mid] == target:
|
| 38 |
+
return mid
|
| 39 |
+
elif arr[mid] < target:
|
| 40 |
+
left = mid + 1
|
| 41 |
+
else:
|
| 42 |
+
right = mid - 1
|
| 43 |
+
return -1
|
| 44 |
+
|
| 45 |
+
def is_palindrome(s):
|
| 46 |
+
s = s.lower()
|
| 47 |
+
return s == s[::-1]
|
| 48 |
+
|
| 49 |
+
def sum_list(numbers):
|
| 50 |
+
total = 0
|
| 51 |
+
for num in numbers:
|
| 52 |
+
total += num
|
| 53 |
+
return total
|