acm-problem-solution/BinarySearchMagic.py at master · fkshohag/acm-problem-solution · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
class Binary_Search:
	def Insertion_sort(self,array):
		for i in range(0,len(array)):
			j=i
			while j>0 and array[i]<array[j-1]:
				j=j-1
			temp=array[i]
			for k in xrange(i,j,-1):
				array[k]=array[k-1]
			array[j]=temp
	def Bubble_sort(self,array):
		for i in xrange(0,len(array)):
			for j in xrange(0,len(array)-1):
				if array[j]>array[j+1]:
					temp=array[j]
					array[j]=array[j+1]
					array[j+1]=temp
	def De_bubble_sort(self,array):
		for i in xrange(0,len(array)):
			for j in xrange(0,len(array)-1):
				if array[j]<array[j+1]:
					temp=array[j]
					array[j]=array[j+1]
					array[j+1]=temp
	def binary_search(self,array,key):
		Index=None
		begin=0
		End=len(array)
		while begin<=End:
			mid=(begin+End)/2
			if key==array[mid]:
				Index=mid
				break
			elif key>array[mid]:
				begin=mid+1
			elif key<array[mid]:
				End=mid-1
		return Index
	def binary_searchLeftIndex(self,array,key):
		Index=None
		begin=0
		End=len(array)
		while begin<=End:
			mid=(begin+End)/2
			if key==array[mid]:
				Index=mid
				End=mid-1
			elif key>array[mid]:
				begin=mid+1
			elif key<array[mid]:
				End=mid-1
		return Index
	def binary_searchRigtIndex(self,array,key):
		Index=None
		begin=0
		End=len(array)
		while begin<=End:
			mid=(begin+End)/2
			if key==array[mid]:
				Index=mid
				begin=mid+1
			elif key>array[mid]:
				begin=mid+1
			elif key<array[mid]:
				End=mid-1
		return Index
	def lower_bondIndex(self,array,key):
		Index=None
		begin=0
		End=len(array)-1
		while begin<=End:
			mid=(begin+End)/2
			if key==array[mid]:
				Index=mid
				End=mid-1
			elif key>array[mid]:
				begin=mid+1
			elif key<array[mid]:
				End=mid-1
		return begin
	def isRange(self,array,key):
		Len=len(array)
		Len=Len-1
		if key>array[Len]:
			return 0
		elif key<array[0]:
			return 0
		else:
			return 1
	def upper_bondIndex(self,array,key):
		Index=None
		begin=0
		End=len(array)
		while begin<=End:
			mid=(begin+End)/2
			if key==array[mid]:
				Index=mid
				begin=mid+1
			elif key>array[mid]:
				begin=mid+1
			elif key<array[mid]:
				End=mid-1
		return End+1
	def Sqrt(self,x):
		low=0.0
		high=x
		while high-low>.00000000000001:
			mid=(low+high)/2
			if mid*mid>x:
				high=mid;
			else:
				low=mid
		return mid
b=Binary_Search()
print(b.Sqrt(15))