Merge remote-tracking branch 'upstream/master'

Author: NickTheBit

Counting-sort.py

@@ -1,36 +1,53 @@
-# counting sort
-
-l = []  # l is the list 
-
-n = int(input("Enter number of elements in the list: "))
-
-highest = 0
-
-for i in range(n):
-    temp = int(input("Enter element" + str(i + 1) + ': '))
-
-    if temp > highest:
-        highest = temp
-
-    l += [temp]
-
-
-def counting_sort(l, h):
-    bookkeeping = [0 for i in range(h + 1)]
-
-    for i in l:
-        bookkeeping[i] += 1
-
-    L = []
-
-    for i in range(len(bookkeeping)):
-
-        if bookkeeping[i] > 0:
-
-            for j in range(bookkeeping[i]):
-                L += [i]
-
-    return L
-
-
-print(counting_sort(l, highest))
+#python program for counting sort (updated)
+#import some libraries
+import random, math
+def get_sortkey(n):
+    # Define the method to retrieve the key 
+    return n
+
+def counting_sort(tlist, k, get_sortkey):
+    """ Counting sort algo with sort in place.
+        Args: 
+            tlist: target list to sort
+            k: max value assume known before hand
+            get_sortkey: function to retrieve the key that is apply to elements of tlist to be used in the count list index.
+            map info to index of the count list.
+        Adv:
+            The count (after cum sum) will hold the actual position of the element in sorted order
+            Using the above, 
+            
+    """
+
+    # Create a count list and using the index to map to the integer in tlist.
+    count_list = [0]*(k)
+
+    # iterate the tgt_list to put into count list
+    for n in tlist:
+        count_list[get_sortkey(n)] = count_list[get_sortkey(n)] + 1  
+        
+    # Modify count list such that each index of count list is the combined sum of the previous counts 
+    # each index indicate the actual position (or sequence) in the output sequence.
+    for i in range(k):
+        if i ==0:
+            count_list[i] = count_list[i]
+        else:
+            count_list[i] += count_list[i-1]
+ 
+
+    output = [None]*len(tlist)
+    for i in range(len(tlist)-1, -1, -1):
+        sortkey = get_sortkey(tlist[i])
+        output[count_list[sortkey]-1] = tlist[i]
+        count_list[sortkey] -=1
+
+    return output
+    
+#----- take list from user-----------
+li_st = [int(x) for x in input().split()]
+print("Unsorted List")
+print(li_st)
+
+##------working on our algo-----------
+print("\nSorted list using basic counting sort")
+output = counting_sort(li_st, max(li_st) +1, get_sortkey) 
+print(output)

brickout-game/brickout-game.py

@@ -16,7 +16,7 @@
 """
 
 import random
-
+#using pygame python GUI 
 import pygame
 
 # Define Four Colours

gcd.py

@@ -1,18 +1,14 @@
-"""
-This function takes two variable and returns greatest common divisior
-"""
-
-
-def find_gcd(x, y):
-    while (y):
-        x, y = y, x % y
-
-    return x
-
-    # Input from user
-    print("For computing gcd of two numbers")
-    a, b = map(int, input("Enter the number by comma separating :-", end=" ").split(","))
-
-    # Map typecast the input in 'int' type
-
-    print("Gcd of {} & {} is {}", format(a, b, find_gcd(a, b)))
+'''
+although there is function to find gcd in python but this is the code which
+takes two inputs and prints gcd of the two.
+'''
+a = int(input("Enter number 1 (a): "))
+b = int(input("Enter number 2 (b): "))
+
+i = 1
+while(i <= a and i <= b):
+    if(a % i == 0 and b % i == 0):
+        gcd = i
+    i = i + 1
+    
+print("\nGCD of {0} and {1} = {2}".format(a, b, gcd))