Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file added .DS_Store
Binary file not shown.
6 changes: 6 additions & 0 deletions Suryansh/q1.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
text = 'Hello world!'
text2 = ''
for i in text:
text2 = i + text2

print(text2)
3 changes: 3 additions & 0 deletions Suryansh/q2.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
for i in range(1, 100):
if i%2 != 0 and i%5 != 0:
print(i)
12 changes: 12 additions & 0 deletions Suryansh/q3.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
# Armstrong number
# Sum of cubes of digits = number
print("Enter the number you wanna check")
n = input()
temp = n
armstrong = 0
while n >= 0:
armstrong += n%10 ** 3
n /= 10

if armstrong == temp:
print('Armstrong Number')
39 changes: 39 additions & 0 deletions Suryansh/q4.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
# Merge Sort
def mergeSort(arr):
if len(arr) > 1:

mid = len(arr)//2

L = arr[:mid]

R = arr[mid:]

mergeSort(L)

mergeSort(R)

i = j = k = 0

while i < len(L) and j < len(R):
if L[i] <= R[j]:
arr[k] = L[i]
i += 1
else:
arr[k] = R[j]
j += 1
k += 1

while i < len(L):
arr[k] = L[i]
i += 1
k += 1

while j < len(R):
arr[k] = R[j]
j += 1
k += 1

def printList(arr):
for i in range(len(arr)):
print(arr[i], end=" ")
print()
8 changes: 8 additions & 0 deletions Suryansh/q5.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
# Bubble Sort
def bubbleSort(arr):
n = len(arr)

for i in range(n):
for j in range(0, n-i-1):
if arr[j] > arr[j+1]:
arr[j], arr[j+1] = arr[j+1], arr[j]