Merge pull request #51 from MIT-Emerging-Talent/challenge/sort_number…

…s_in_ascending_order earsed mention of strategy from docstring
MIT-Emerging-Talent · Jan 10, 2025 · f5ce6b4 · f5ce6b4
2 parents becec91 + d828507
commit f5ce6b4
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/solutions/sort_ascending.py b/solutions/sort_ascending.py
@@ -1,5 +1,5 @@
 """
-    A module for sorting numbers in a list in ascending order using Bubble Sort algorithm.
+    A module for sorting numbers in a list of ascending order.
 
 Module contents:
     - sort_ascending: A function to sort a list of integers in ascending order.
@@ -12,7 +12,7 @@
 
 def sort_ascending(numbers: list[int]) -> list[int]:
     """
-    The function takes a list of int & sorts it in ascending order using the bubble Sort strategy.
+    The function takes a list of int and return a new sorted list of int in ascending order.
 
     Parameters:
         Numbers (list[int]): this is the list of numbers we want to sort

diff --git a/solutions/tests/test_sort_ascending.py b/solutions/tests/test_sort_ascending.py
@@ -18,7 +18,7 @@
 
 
 class TestSortAscending(unittest.TestCase):
-    """These unittest cases will test the sort_ascending function using bubble sort algorithm."""
+    """These unittest cases will test the sort_ascending function."""
 
     def test_empty_list(self):
         """it should return an empty list"""