Merge pull request dynstat#22 from kanstat/main

new programs added

Author: dynstat

kanchan/Linked_list/reverselinkedlist.py

@@ -0,0 +1,45 @@
+
+class Node:
+    def __init__(self, val):
+        self.next = None
+        self.value = val
+
+
+class linked_list:
+    def __init__(self, head=None):
+        self.head = head
+    # a function to reverse the linked list
+
+    def reverse_list(self):
+        current = self.head
+        previous = None
+        nxt = None
+        while current:
+            nxt = current.next
+            current.next = previous
+            previous = current
+            current = nxt
+        self.head = previous
+
+    def Traverse(self):
+        temp = self.head
+        while temp:
+            print(temp.value, end=" ")
+            temp = temp.next
+        print()
+
+
+if __name__ == "__main__":
+    node1 = Node(1)
+    node2 = Node(2)
+    node3 = Node(3)
+    node4 = Node(4)
+    head = node1
+    node1.next = node2
+    node2.next = node3
+    node3.next = node4
+
+    linkedlist = linked_list(head)
+    linkedlist.Traverse()
+    linkedlist.reverse_list()
+    linkedlist.Traverse()

kanchan/Sorting/bubble_sort.py

@@ -0,0 +1,16 @@
+# bubble sort algorithm to sort data
+
+def bubbleSort(arr):
+
+    for i in range(len(arr)):
+        for j in range(0, len(arr)-i-1):
+            if arr[j] > arr[j+1]:
+                temp = arr[j]
+                arr[j] = arr[j+1]
+                arr[j+1] = temp
+    return arr
+
+
+if __name__ == "__main__":
+    arr = [45, 5, 3, 8, 9, 4]
+    print(bubbleSort(arr))

kanchan/Sorting/selection_sort.py

@@ -0,0 +1,23 @@
+# selection sorting algorthm
+
+def selectionSort(arr: list):
+    length = len(arr)
+    for i in range(length):
+        id_min = i
+        j = i+1
+        while(j < length):
+            if arr[j] < arr[id_min]:
+                id_min = j
+            j = j+1
+        temp = arr[i]
+        arr[i] = arr[id_min]
+        arr[id_min] = temp
+    return arr
+
+
+if __name__ == "__main__":
+    print("before sorting")
+    arr = [6, 3, 2, 4, 1, 0]
+    print(arr)
+    print("after sorting")
+    print(selectionSort(arr))