Update README.md

README.md

@@ -63,7 +63,7 @@ content: Here's a quicksort algorithm implementation in Python:
 
 ```python
 def quicksort(arr):
-    """
+    '''
     Sorts an array using the quicksort algorithm.
 
     Args:
@@ -71,12 +71,12 @@ def quicksort(arr):
 
     Returns:
         None (sorts in-place)
-    """
+    '''
     if len(arr) <= 1:
         return
 
     def partition(low, high):
-        """Partition function using the last element as pivot"""
+        '''Partition function using the last element as pivot'''
         pivot = arr[high]
         i = low - 1  # Index of smaller element
 
@@ -89,7 +89,7 @@ def quicksort(arr):
         return i + 1
 
     def quicksort_helper(low, high):
-        """Recursive helper function"""
+        '''Recursive helper function'''
         if low < high:
             # Partition the array and get pivot index
             pi = partition(low, high)
@@ -143,7 +143,7 @@ if __name__ == "__main__":
 import random
 
 def quicksort_random(arr):
-    """Quicksort with random pivot selection for better average performance"""
+    '''Quicksort with random pivot selection for better average performance'''
     def partition(low, high):
         # Randomly select pivot and swap with last element
         random_index = random.randint(low, high)