Skip to content

Commit 26230bb

Browse files
authored
Add files via upload
recursion example
1 parent 11cb6e2 commit 26230bb

File tree

4 files changed

+97
-0
lines changed

4 files changed

+97
-0
lines changed

binary_search.py

+40
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
import numpy as np
2+
3+
array = np.random.randint(30,size=20)
4+
a = [15,13,14,3,8,5,27,17,7,20,6,1,4,11]
5+
print(len(a))
6+
final=0
7+
loop = 0
8+
for j in range(0,len(a)-1,1):
9+
for i in range(0,len(a)-1-j,1):
10+
if a[i]>a[i+1]:
11+
swap = a[i+1]
12+
a[i+1] = a[i]
13+
a[i]= swap
14+
loop = loop+1
15+
16+
print(a)
17+
# print(loop)
18+
19+
#binary search
20+
target = 27
21+
start = round(len(a) / 2)
22+
23+
while 1:
24+
if a[start]>target:
25+
prev = start
26+
start = start -1
27+
print(prev)
28+
print(start)
29+
else:
30+
prev = start
31+
start = start+1
32+
33+
if start<end:
34+
print(a[start])
35+
print('index %i' %start)
36+
break
37+
38+
else:
39+
print('not found')
40+

list_node.py

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
# Definition for singly-linked list.
2+
class ListNode(object):
3+
def __init__(self, x):
4+
self.val = x
5+
self.next = None

recursive_string.py

+13
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
2+
def main():
3+
s = input('Please enter desired string')
4+
a = reverseString(s)
5+
print('Reversed string will be: %s'%a)
6+
7+
def reverseString(s):
8+
if len(s)==0:
9+
return s
10+
else:
11+
return reverseString(s[1:]) + s[0]
12+
main()
13+

swap_node_in_pairs.py

+39
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
# Given 1->2->3->4, you should return the list as 2->1->4->3.
2+
# Definition for singly-linked list.
3+
4+
from list_node import ListNode
5+
6+
def main():
7+
w=ListNode(1)
8+
x=ListNode(2)
9+
y =ListNode(3)
10+
z = ListNode(4)
11+
w.next = x
12+
x.next = y
13+
y.next = z
14+
print(w.val)
15+
print(w.next.val)
16+
print(w.next.next.val)
17+
print(w.next.next.next.val)
18+
19+
swap(w)
20+
print(w.val)
21+
print(w.next.val)
22+
print(w.next.next.val)
23+
print(w.next.next.next.val)
24+
25+
def swap(x):
26+
27+
temp = x.val
28+
temp2 = x.next.val
29+
x.val = temp2
30+
x.next.val = temp
31+
32+
if x.next.next== None:
33+
return x
34+
else:
35+
swap(x.next.next)
36+
return x
37+
38+
main()
39+

0 commit comments

Comments
 (0)