nai changes

Author: 83go

gowthami/large_optimised.py

@@ -0,0 +1,13 @@
+arr=[6,3,10,5,3,2]
+
+def largest(arr: list, n: int) -> int:
+    largest=arr[0]
+    for i in range(0,n):
+        if arr[i]>largest:
+            largest=arr[i]
+    return largest
+
+print(largest(arr,len(arr)))
+
+# O(n) -> Time Complexity
+# O(n) -> Space complexity

gowthami/large_sort.py

@@ -0,0 +1,14 @@
+from typing import List
+def sort(a : List[int]) -> int:
+    a.sort()
+    return a[-1]
+if __name__=="__main__":
+    a=[1,3,4,2,5,6,3]
+    print(sort(a))
+
+# a=[3,4,7,10,2,66]
+# a.sort()
+# n=len(a)
+# print(a[n-1])
+
+# O(n log n) because we are sorting

gowthami/seclarge_better.py

@@ -0,0 +1,14 @@
+a=[6,3,10,5,3,2]
+largest=a[0]
+n=len(a)
+for i in range(1,n-1):
+    if a[i] > largest:
+        largest = a[i]
+seclarg=-1
+for i in range( 0, n-1):
+    if a[i] > seclarg and a[i] != largest:
+        seclarg= a[i]
+print(seclarg)
+
+# O(N + N) = 2N
+# since we are traversing the array two types

gowthami/seclarge_optimised.py

@@ -0,0 +1,26 @@
+a=[5,3,2,4,10,2,3,6,6,3,10,7]
+large=a[0]
+seclarge=-1
+n=len(a)
+for i in range(0,n):
+    if a[i] > large:
+        seclarge = large
+        large = a[i]
+    elif a[i] < large and a[i] > seclarge:
+        seclarge = a[i]
+print(seclarge)
+
+# def secondSmallest(arr, n):
+#     if (n < 2):
+#         return -1
+#     small = float('inf')
+#     second_small = float('inf')
+#     for i in range(n):
+#         if (arr[i] < small):
+#             second_small = small
+#             small = arr[i]
+#         elif (arr[i] < second_small and arr[i] != small):
+#             second_small = arr[i]
+#     return second_small
+
+# O(n) traversing the array once

gowthami/seclarge_sort.py

@@ -0,0 +1,13 @@
+a=[1,2,2,2,2,2,2]
+a.sort()
+print(a)
+n=len(a)
+largest=a[n-1]
+for i in range(n-2,-1,-1):
+    if a[i] != largest:
+        seclarg=a[i]
+        break;
+else:
+    seclarg=None
+print(seclarg)
+#n log n + N