class Solution:
    def bubbleSortOptimized(self, nums: List[int]) -> None:
        if len(nums) == 1:
            return nums
        else:
            swapped = False
            while not swapped:
                swapped = True
                for i in range(0, len(nums)-1):
                    if nums[i] > nums[i+1]:
                        swapped = False
                        nums[i], nums[i+1] = nums[i+1], nums[i]
class Solution:
    def bubbleSortOptimized(self, nums):
        if len(nums) == 1:
            return nums
        else:
            swapped = False
            while not swapped:
                swapped = True
                for i in range(0, len(nums)-1):
                    if nums[i] > nums[i+1]:
                        swapped = False
                        nums[i], nums[i+1] = nums[i+1], nums[i]
Add dijkstras algorithm and depth first search in python
Add dijkstras algorithm and depth first search in python

  class Solution:
-     def bubbleSortOptimized(self, nums: List[int]) -> None:
+     def bubbleSortOptimized(self, nums):
          if len(nums) == 1:
              return nums
          else:
              swapped = False
              while not swapped:
                  swapped = True
                  for i in range(0, len(nums)-1):
                      if nums[i] > nums[i+1]:
                          swapped = False
                          nums[i], nums[i+1] = nums[i+1], nums[i]
Add dijkstras algorithm and depth first search in python
## Code Before:
class Solution:
    def bubbleSortOptimized(self, nums: List[int]) -> None:
        if len(nums) == 1:
            return nums
        else:
            swapped = False
            while not swapped:
                swapped = True
                for i in range(0, len(nums)-1):
                    if nums[i] > nums[i+1]:
                        swapped = False
                        nums[i], nums[i+1] = nums[i+1], nums[i]
## Instruction:
Add dijkstras algorithm and depth first search in python
## Code After:
class Solution:
    def bubbleSortOptimized(self, nums):
        if len(nums) == 1:
            return nums
        else:
            swapped = False
            while not swapped:
                swapped = True
                for i in range(0, len(nums)-1):
                    if nums[i] > nums[i+1]:
                        swapped = False
                        nums[i], nums[i+1] = nums[i+1], nums[i]