diff --git a/.idea/Python_Practice.iml b/.idea/Python_Practice.iml
deleted file mode 100644
index 6711606..0000000
--- a/.idea/Python_Practice.iml
+++ /dev/null
@@ -1,11 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/.idea/misc.xml b/.idea/misc.xml
deleted file mode 100644
index a2e120d..0000000
--- a/.idea/misc.xml
+++ /dev/null
@@ -1,4 +0,0 @@
-
-
-
-
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
deleted file mode 100644
index a90e161..0000000
--- a/.idea/modules.xml
+++ /dev/null
@@ -1,8 +0,0 @@
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
deleted file mode 100644
index 94a25f7..0000000
--- a/.idea/vcs.xml
+++ /dev/null
@@ -1,6 +0,0 @@
-
-
-
-
-
-
\ No newline at end of file
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
deleted file mode 100644
index 4ceeef9..0000000
--- a/.idea/workspace.xml
+++ /dev/null
@@ -1,866 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- Node
- Tree
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 1595870279063
-
-
- 1595870279063
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- file://$PROJECT_DIR$/Binary_Trees_Practice/Binary_Trees_Workbook.py
- 54
-
-
-
- file://$APPLICATION_CONFIG_DIR$/scratches/scratch.py
- 17
-
-
-
- file://$APPLICATION_CONFIG_DIR$/scratches/scratch_1.py
- 28
-
-
-
- file://$PROJECT_DIR$/Binary_Trees_Practice/Binary_Trees_Practice_August_19.py
- 27
-
-
-
- file://$PROJECT_DIR$/Binary_Trees_Practice/Binary_Trees_Practice_September_29.py
- 27
-
-
-
- file://$PROJECT_DIR$/Binary_Search/Binary_Search_Practice_October_1.py
- 131
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/Binary_Search/Binary_Search_Practice_October_8.py b/Binary_Search/Binary_Search_Practice_October_8.py
index 3f531fa..51b7a3a 100644
--- a/Binary_Search/Binary_Search_Practice_October_8.py
+++ b/Binary_Search/Binary_Search_Practice_October_8.py
@@ -46,7 +46,7 @@ def binary_search(nums, target):
mid = (left + right) // 2
if nums[mid] == target:
return mid
- elif nums[mid] < target
+ elif nums[mid] < target:
left = mid + 1
else:
right = mid - 1
diff --git a/Return_Sum_Min_Pair_From_Array/Return_Sum_Min_Pair_From_Array_September_30.py b/Return_Sum_Min_Pair_From_Array/Return_Sum_Min_Pair_From_Array_September_30.py
index 9700036..8a1a3f4 100644
--- a/Return_Sum_Min_Pair_From_Array/Return_Sum_Min_Pair_From_Array_September_30.py
+++ b/Return_Sum_Min_Pair_From_Array/Return_Sum_Min_Pair_From_Array_September_30.py
@@ -1,51 +1,18 @@
import sys
-# def smallest_pair(nums):
-# min = sys.maxsize
-# secondMin = sys.maxsize
-# for j in range(len(nums)):
-# if nums[j] < min:
-# secondMin = min
-# min = nums[j]
-# elif (nums[j] < secondMin) and (nums[j] != min):
-# secondMin = nums[j]
-# return secondMin + min
def smallest_pair(nums):
- min = float('inf')
- secondMin = float('inf')
- for j in range(len(nums)):
- if nums[j] < min:
- secondMin = min
- min = nums[j]
- elif (nums[j] < secondMin) and (nums[j] != min):
- secondMin = nums[j]
- return secondMin + min
+ min_number = nums[0]
+ second_min = nums[1]
+ for ind, i in enumerate(nums[2:]):
+ if i < min_number:
+ second_min = min_number
+ min_number = i
+ elif (i < second_min) and (i != min_number):
+ second_min = nums[j]
+ return second_min + min_number
-def smallest_pair(nums):
- min = float('inf')
- secondMin = float('inf')
- for j in range(len(nums)):
- if nums[j] < min:
- secondMin = min
- min = nums[j]
- elif (nums[j] < secondMin) and (nums[j] != min):
- secondMin = nums[j]
- return secondMin + min
-
-
-def smallest_pair(nums):
- min = float('inf')
- secondMin = float('inf')
- for j in range(len(nums)):
- if nums[j] < min:
- secondMin = min
- min = nums[j]
- elif (nums[j] < secondMin) and (nums[j] != min):
- secondMin = nums[j]
- return secondMin + min
-
if __name__ == "__main__":
- nums = [1,2,3,4,5]
- print(smallest_pair(nums))
\ No newline at end of file
+ nums = [1, 2, 3, 4, 5]
+ print(smallest_pair(nums))