cation03
diff --git a/‎GrayCodetoBinary.py‎
Lines changed: 37 additions & 0 deletions b/‎GrayCodetoBinary.py‎
Lines changed: 37 additions & 0 deletions
diff --git a/‎radixSort.py‎
Lines changed: 60 additions & 0 deletions b/‎radixSort.py‎
Lines changed: 60 additions & 0 deletions
@@ -0,0 +1,37 @@
+def flip_num(my_nu):
+    return '1' if(my_nu == '0') else '0';
+
+def gray_to_binary(gray):
+    binary_code=""
+    binary_code += gray[0]
+    for i in range(1,len(gray)):
+
+        if (gray[i]=='0'):
+            binary_code += binary_code[i-1]
+        else:
+            binary_code += flip_num(binary_code[i-1])
+
+    return binary_code
+
+# gray_code="01101001"
+
+
+gray_code=input("please enter the gray code\n")
+print("the gray code is : ")
+print(gray_code)
+# x=gray_to_binary(gray_code)
+print("binary code of", gray_code, "is",gray_to_binary(gray_code))              
+
+# for converting binary numb to decimal
+value=0
+b_num=list(gray_to_binary(gray_code))
+
+for i in range(len(b_num)):
+    digit=b_num.pop()
+    if digit =='1':
+        value = value + pow(2,i)
+
+print("the decimal value of the number is ", value)        
+
+
+# print(12//5)
@@ -0,0 +1,60 @@
+# Python program for implementation of Radix Sort
+
+# A function to do counting sort of arr[] according to
+# the digit represented by exp.
+def countingSort(arr, exp1):
+
+	n = len(arr)
+
+	# The output array elements that will have sorted arr
+	output = [0] * (n)
+
+	# initialize count array as 0
+	count = [0] * (10)
+
+	# Store count of occurrences in count[]
+	for i in range(0, n):
+		index = (arr[i]/exp1)
+		count[int((index)%10)] += 1
+
+	# Change count[i] so that count[i] now contains actual
+	# position of this digit in output array
+	for i in range(1,10):
+		count[i] += count[i-1]
+
+	# Build the output array
+	i = n-1
+	while i>=0:
+		index = (arr[i]/exp1)
+		output[ count[ int((index)%10) ] - 1] = arr[i]
+		count[int((index)%10)] -= 1
+		i -= 1
+
+	# Copying the output array to arr[],
+	# so that arr now contains sorted numbers
+	i = 0
+	for i in range(0,len(arr)):
+		arr[i] = output[i]
+
+# Method to do Radix Sort
+def radixSort(arr):
+
+	# Find the maximum number to know number of digits
+	max1 = max(arr)
+
+	# Do counting sort for every digit. Note that instead
+	# of passing digit number, exp is passed. exp is 10^i
+	# where i is current digit number
+	exp = 1
+	while max1/exp > 0:
+		countingSort(arr,exp)
+		exp *= 10
+
+# Driver code to test above
+arr = [ 170, 45, 75, 90, 802, 24, 2, 66]
+radixSort(arr)
+
+for i in range(len(arr)):
+	print(arr[i],end=" ")
+
+