Skip to content

Commit b58ffde

Browse files
Non
1 parent 4161e12 commit b58ffde

2 files changed

Lines changed: 34 additions & 8 deletions

File tree

OOPS/merge_sort.py

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
nums=[5,12,49,1,65,6,100,3,2,7,9,11,33,55,88]
2+
mid=len(nums)//2
3+
left_half=nums[:mid]
4+
right_half=nums[mid:]
5+
print(left_half)
6+
print(right_half)
7+
i=0
8+
j=0
9+
arr=[]
10+
while i<len(left_half) and j<len(right_half):
11+
if left_half[i] < right_half[j]:
12+
arr.append(left_half[i])
13+
i+=1
14+
else:
15+
arr.append(right_half[j])
16+
j+=1
17+
print(arr)

OOPS/tempCodeRunnerFile.py

Lines changed: 17 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,17 @@
1-
class konda:
2-
def reddy(self):
3-
self.name=self.name
4-
self.age=self.age
5-
class DerivedClass(konda):
6-
def reddy(self):
7-
self.na=self.na
8-
print(issubclass(konda,DerivedClass))
1+
nums=[5,12,49,1,65,6,100,3,2,7,9,11,33,55,88]
2+
mid=len(nums)//2
3+
left_half=nums[:mid]
4+
right_half=nums[mid:]
5+
print(left_half)
6+
print(right_half)
7+
i=0
8+
j=0
9+
arr=[]
10+
while i<len(left_half) and j<len(right_half):
11+
if left_half[i] < right_half[j]:
12+
arr.append(left_half[i])
13+
i+=1
14+
else:
15+
arr.append(right_half[j])
16+
j+=1
17+
print(arr)

0 commit comments

Comments
 (0)