init

coderdrew26 · coderdrew26 · commit 4f6e0c97cb13 · 2022-08-31T11:55:01.000+08:00
diff --git a/datastructures/array1.py b/datastructures/array1.py
@@ -0,0 +1,4 @@
+stock_price = [[298, 305, 320, 301, 292],
+            ]
+for price in stock_price:
+    print(price)
diff --git a/datastructures/big_O_of_n.py b/datastructures/big_O_of_n.py
@@ -0,0 +1,8 @@
+def get_squared_numbers(numbers):
+    squared_numbers = []
+    for n in numbers:
+        squared_numbers.append(n*n)
+    return squared_numbers
+
+numbers = [2,5,8,9]
+print(get_squared_numbers(numbers))
diff --git a/datastructures/binary_search.py b/datastructures/binary_search.py
@@ -0,0 +1,50 @@
+import random
+import time
+
+def naive_search(l, target):
+    for i in range(len(l)):
+        if l[i] == target:
+            return i
+    return -1
+
+def binary_search(l, target, low=None, high=None):
+    if low is None:
+        low = 0
+    if high is None:
+        high = len(l) - 1
+        
+    midpoint = (low + high) // 2
+    
+    if high < low:
+        return -1
+    
+    if l[midpoint] == target:
+        return midpoint
+    elif target < l[midpoint]:
+        return binary_search(l, target, low, midpoint-1)
+    else:
+        return binary_search(l, target, midpoint+1, high)
+    
+if __name__=='__main__':
+    l = [1, 3, 5, 10, 12]
+    target = 10
+    print(naive_search(l, target))
+    print(binary_search(l, target))
+    
+    length = 10000
+    sorted_list = set()
+    while len(sorted_list) < length:
+        sorted_list.add(random.randint(-3*length, 3*length))
+    sorted_list = sorted(list(sorted_list))
+    
+    start = time.time()
+    for target in sorted_list:
+        naive_search(sorted_list, target)
+    end = time.time()
+    print("Naive search time: ", (end - start)/length, "seconds")
+    
+    start = time.time()
+    for target in sorted_list:
+        binary_search(sorted_list, target)
+    end = time.time()
+    print("Binary search time: ", (end - start)/length, "seconds")
diff --git a/datastructures/bubblesort.py b/datastructures/bubblesort.py
@@ -0,0 +1,23 @@
+def bubble_sort(elements):
+    size = len(elements)
+    
+    for i in range(size-1):
+        swapped = False
+        for j in range(size-1-i):
+            if elements[j] > elements[j+1]:
+                tmp = elements[j]
+                elements[j] = elements[j+1]
+                elements[j+1] = tmp
+                swapped = True
+        if not swapped:
+            break
+            
+            
+if __name__ == '__main__':
+    elements = [5,9,2,1,67,34,88,34]
+    
+    #elements = [1,2,4]
+    #elements = ["Zed",  "Yama", "Abaho", "Carcar"]
+    
+    bubble_sort(elements)
+    print(elements)
diff --git a/datastructures/codebasics_exercise2.py b/datastructures/codebasics_exercise2.py
@@ -0,0 +1,8 @@
+exp = [2200, 2350, 2600, 2130, 2190]
+print(exp[1]-exp[0])
+print(exp[0]+exp[1]+exp[2])
+print(2000 in exp)
+exp.append(1980)
+print(exp)
+exp[3] = exp[3] - 200
+print(exp)
diff --git a/datastructures/codebasics_exercise2_2.py b/datastructures/codebasics_exercise2_2.py
@@ -0,0 +1,12 @@
+heros = ['spider man', 'thor', 'hulk', 'iron man', 'captain america']
+print(len(heros))
+heros.append('black panther')
+print(heros)
+heros.remove('black panther')
+print(heros)
+heros.insert(3, 'black panther')
+print(heros)
+heros[1:3] = ['doctor strange']
+print(heros)
+heros.sort()
+print(heros)
diff --git a/datastructures/codebasics_exercise2_3.py b/datastructures/codebasics_exercise2_3.py
@@ -0,0 +1,9 @@
+max = int(input("Enter max number: "))
+
+odd_numbers = []
+
+for i in range(1, max):
+    if i % 2 == 1:
+        odd_numbers.append(i)
+        
+print("Odd numbers are: ", odd_numbers)
diff --git a/datastructures/linked_list.py b/datastructures/linked_list.py
@@ -0,0 +1,136 @@
+class Node:
+    def __init__(self, data=None, next=None):
+        self.data = data
+        self.next = next
+        
+class LinkedList:
+    def __init__(self):
+        self.head = None
+    
+    def insert_at_beginning(self, data):
+        node = Node(data, self.head)
+        self.head = node
+        
+    def print(self):
+        if self.head is None:
+            print("Linked list is empty")
+            return
+        
+        itr = self.head
+        llstr = ''
+        
+        while itr:
+            llstr += str(itr.data) + '-->'
+            itr = itr.next
+        
+        print(llstr)
+        
+    def insert_at_end(self, data):
+        if self.head is None:
+            self.head = Node(data, None)
+            return
+        
+        itr  = self.head
+        while itr.next:
+            itr = itr.next
+            
+        itr.next = Node(data, None)
+        
+    def insert_values(self, data_list):
+        self.head = None
+        for data in data_list:
+            self.insert_at_end(data)
+            
+    def get_length(self):
+        count = 0
+        itr = self.head
+        while itr:
+            count += 1
+            itr = itr.next
+            
+        return count
+        
+    def remove_at(self, index):
+        if index < 0 or index >= self.get_length():
+            raise Exception("This is not a valid index")
+        
+        if index == 0:
+            self.head = self.head.next
+            return
+
+        count = 0
+        itr = self.head
+        while itr:
+            if count == index - 1:
+                itr.next = itr.next.next
+                break
+            
+            itr = itr.next
+            count += 1
+            
+    def insert_at(self, index, data):
+        if index < 0 or index > self.get_length():
+            raise Exception("This is not a valid index")
+        
+        if index == 0:
+            self.insert_at_beginning(data)
+            return
+        
+        count = 0
+        itr = self.head
+        while itr:
+            if count == index -1:
+                node = Node(data, itr.next)
+                itr.next = node
+                break
+                
+            itr = itr.next
+            count += 1
+            
+    def insert_after_value(self, data_after, data_to_insert):
+        if self.head is None:
+            return
+        
+        if self.head.data == data_after:
+            self.head.next = Node(data_to_insert, self.head.next)
+            return
+        
+        itr = self.head
+        while itr:
+            if itr.data == data_after:
+                itr.next = Node(data_to_insert, itr.next)
+                break
+            
+            itr = itr.next
+        
+    def remove_by_value(self, data):
+        if self.head is None:
+            return
+        
+        if self.head == data:
+            self.head = self.head.next
+            return
+
+        itr = self.head
+        while itr.next:
+            if itr.next.data == data:
+                itr.next = itr.next.next
+                break
+            itr = itr.next
+
+        
+if __name__=="__main__":
+    ll = LinkedList()
+    ll.insert_values(["banana", "mango", "grapes", "orange"])
+    ll.print()
+    ll.insert_after_value("mango","apple")
+    ll.print()
+    ll.remove_by_value("orange")
+    ll.print()
+    ll.remove_by_value("figs")
+    ll.print()
+    ll.remove_by_value("banana")
+    ll.remove_by_value("mango")
+    ll.remove_by_value("apple")
+    ll.remove_by_value("grapes")
+    ll.print()
diff --git a/datastructures/tempCodeRunnerFile.python b/datastructures/tempCodeRunnerFile.python
@@ -0,0 +1,8 @@
+exp = [2200, 2350, 2600, 2130, 2190]
+print(exp[1]-exp[0])
+print(exp[0]+exp[1]+exp[2])
+print(2000 in exp)
+exp.append(1980)
+print(exp)
+exp[3] = exp[3] - 200
+print(exp)
diff --git a/jackenpoy.py b/jackenpoy.py
@@ -2,8 +2,10 @@
 
 def play():
     print("Laro tayo ng Bato-Bato-Pik!")
-    user = input("I-type ang 'b' para sa bato, 'p' para sa papel at 'g' para sa gunting.\n")
-    computer = random.choice(['b', 'p', 'g'])
+    user = input("Pumili sa bato, papel o gunting.\n")
+    computer = random.choice(['bato', 'papel', 'gunting'])
+    
+    print(f"Ang napili mo ay {user}, ang napili ng kalaban mo ay {computer}")
     
     if user == computer:
         return "Tabla ang laro"
@@ -14,8 +16,8 @@ def play():
     return "Ikaw ay natalo."
 
 def is_win(player, opponent):
-    if (player == 'b' and opponent == 'g') or (player == 'g' and opponent == 'p') \
-        or (player == 'p' and opponent == 'b'):
+    if (player == 'bato' and opponent == 'gunting') or (player == 'gunting' and opponent == 'papel') \
+        or (player == 'papel' and opponent == 'bato'):
             return True
         
 
diff --git a/sampleprograms.py b/sampleprograms.py
@@ -1,4 +1,3 @@
-x = int(input("Enter a number:" ))
-y = int(input("Enter a number: "))
-sum = (x + y)
-print(sum)
+print(len("string"))
+print(int(123))
+print(len(1, 2, 3, 4))
diff --git a/tempCodeRunnerFile.python b/tempCodeRunnerFile.python
diff --git a/time_conversion1.py b/time_conversion1.py
@@ -0,0 +1,10 @@
+def timeConversion(s):
+    # Write your code here
+    if(s[-2:] == "AM" and s[:2] == "12"):
+        return "00" + s[2:-2]
+    elif(s[-2:]) == "AM":
+        return s[:-2]
+    elif(s[-2:] == "PM" and s[:2] == "12"):
+        return s[:-2]
+    else:
+        return str(int(s[:2])+12)+s[2:-2]
