bulk pending commits pushed

Author: premaseem

algorithm_and_datastructure/graphs/main.py

@@ -9,7 +9,7 @@
 g.add_edge(2, 3)
 # g.display()
 
-print(g.bfs(g,0))
+print("bfs traverse", g.bfs(g,0))
 #####################
 
 g = gf.Graph(7)

algorithm_and_datastructure/hashing/data_loader.py

@@ -1,7 +1,6 @@
 import random
 import uuid
-# import algorithm.hashing.my_hash_table.MyHashTable as mh
-import my_hash_table as mh
+import algorithm_and_datastructure.hashing.my_hash_table as mh
 
 days = ["Monday", "Tuesday", "Wednesday", "Sunday"]
 domains = ["gmail.com", "yahoo.com", "sexy.com"]
@@ -32,7 +31,7 @@ def read_and_load(f):
         for line in lines:
             k,v = line.split(":")
             print("setting kv", k,v)
-            o.set_value(k,v)
+            o.set_value(k,v,"abc","xyz")
     print(o.get_value("prem@gmail.com"))
 
 

algorithm_and_datastructure/hashing/hashing.py

@@ -0,0 +1,7 @@
+# hashing with resizing
+
+
+
+class HashTable:
+    def __init__(self,size):
+        self.buckets = []

algorithm_and_datastructure/hashing/my_hash_table.py

@@ -56,4 +56,4 @@ def delete_value(self, key):
     print(o.get_value("prem@gmail.com"))
     print(o.delete_value("prem@gmail.com"))
     print("get after delete")
-    print(o.get_value("prem@gmail.com"))
+    print(o.get_value("sony@gmail.com"))

algorithm/recursion/reverse_string.py algorithm_and_datastructure/recursion/reverse_string.py

@@ -1,5 +1,5 @@
 def recure(var):
-    if len(var == 0):
+    if len(var) == 0:
         return ""
     return var[-1] + recure(var[:-1])
 

algorithm_and_datastructure/search/binary_search_iter.py

@@ -1,3 +1,8 @@
+"""
+Like Selection Sort, this algorithm segments the list into sorted and unsorted parts.
+It iterates over the unsorted segment, and inserts the element being viewed into the correct position of the sorted list.
+"""
+
 def insertion_sort(nums):
     # Start on the second element as we assume the first element is sorted
     for i in range(1, len(nums)):

algorithm_and_datastructure/search/binary_search_rec.py

@@ -0,0 +1,35 @@
+"""
+Returns sorted list of integers using Quicksort
+Input: Unsorted list of integers
+Note: This is not an in-place implementation
+"""
+
+l = [10, 9, 4, 7, 2, 4]
+# l = [1,2,3,4,5]
+e = [2, 4, 4, 7, 9, 10]
+
+
+def quick_sort(array):
+    """Sort the array by using quicksort."""
+
+    less = []
+    equal = []
+    greater = []
+
+    if len(array) > 1:
+        pivot = array[0]
+        for x in array:
+            if x < pivot:
+                less.append(x)
+            elif x == pivot:
+                equal.append(x)
+            elif x > pivot:
+                greater.append(x)
+        # Don't forget to return something!
+        return quick_sort(less)+equal+quick_sort(greater)  # Just use the + operator to join lists
+    # Note that you want equal ^^^^^ not pivot
+    else:  # You need to handle the part at the end of the recursion - when you only have one element in your array, just return the array.
+        return array
+
+l = quick_sort(l)
+print("Is sorted properly", e == l)

algorithm_and_datastructure/sorting/bubble_sort1.py

@@ -2,7 +2,7 @@
 
 
 def merge_lists(l1,l2):
-    sl = [0]
+    sl = []
     while l1 and l2:
         if l1[0] <= l2[0]:
             sl.append(l1.pop(0))
@@ -12,7 +12,7 @@ def merge_lists(l1,l2):
         sl.extend(l1)
     if l2:
         sl.extend(l2)
-    return sl[1:]
+    return sl
 
 
 l1 = [2,4,6,8]

algorithm_and_datastructure/sorting/bubble_sort2.py

@@ -0,0 +1,48 @@
+# Implement a function that merges two sorted lists of m and n elements respectively, into another sorted list. Name it merge_lists(lst1, lst2).
+
+
+def merge_lists(l1, l2):
+    sl = []
+    while l1 and l2:
+        l1e = min(l1)
+        l2e = min(l2)
+
+        if l1e < l2e :
+            sl.append(l1e)
+            l1.remove(l1e)
+        else:
+            sl.append(l2e)
+            l2.remove(l2e)
+
+    if l1:
+        sl.extend(l1)
+    if l2:
+        sl.extend(l2)
+    return sl
+
+
+
+
+l1 = [10,76,100,2,4,6,8]
+l2 = [3,5,7,8,9]
+print(merge_lists(l1,l2))
+
+###################
+# In place merge list
+def divide(l):
+    if len(l) <= 1 :
+        return l[:]
+    m = len(l) // 2
+
+    l1 = divide(l[:m])
+    l2 = divide(l[m:])
+
+    return merge_lists(l1,l2)
+
+print(divide([4,2,6,8,1,90,54,23]))
+# merge - divide in l and r
+
+
+l1 = [2,4,6,8]
+l2 = [3,5,7,8,9]
+# print(merge_lists_inplace(l1,l2))

algorithm_and_datastructure/sorting/insertion_sort.py

@@ -0,0 +1,23 @@
+t = 300
+
+def sqr(n):
+    l = 1
+    h = 25
+    while l<h:
+        print(l,h)
+        mid = (l + h) // 2
+        sqr = mid * mid
+        if sqr <= n:
+            l += 1
+        else:
+            h -= 1
+    return l - 1
+
+k = 300
+print(sqr(k))
+
+
+
+
+
+