refactor code

Author: codejsha

python-algorithm/algorithm/greedy/test_cashier_change.py

@@ -10,4 +10,4 @@
 ], ids=["successful1", "successful2"])
 def test_cashier_change(benchmark, denominations, price, expected):
     result = benchmark(cashier_change, denominations, price)
-    assert result == expected
+    assert expected == result

python-algorithm/algorithm/greedy/test_interval_schedule.py

@@ -21,4 +21,4 @@
 ], ids=["successful"])
 def test_interval_scheduling_lecture(benchmark, lectures, expected):
     result = benchmark(interval_scheduling_lecture, lectures)
-    assert result == expected
+    assert expected == result

python-algorithm/algorithm/math/test_addition_integer.py

@@ -9,4 +9,4 @@
 ], ids=["successful"])
 def test_addition_of_binary_number(benchmark, a, b, expected):
     result = benchmark(addition_binary_number, a, b)
-    assert result == expected
+    assert expected == result

python-algorithm/algorithm/math/test_base_expansion.py

@@ -11,4 +11,4 @@
 ], ids=["base8", "base16", "base2"])
 def test_base_expansion(benchmark, number, base, expected):
     result = benchmark(base_expansion, number, base)
-    assert result == expected
+    assert expected == result

python-algorithm/algorithm/math/test_greatest_common_divisor.py

@@ -12,7 +12,7 @@
 def test_gcd_euclidean(benchmark, pair, expected):
     assert is_positive_integer(*pair) is True
     result = benchmark(gcd_euclidean, *pair)
-    assert result == expected
+    assert expected == result
 
 
 @pytest.mark.benchmark(group="gcd_euclidean_divmod")
@@ -24,7 +24,7 @@ def test_gcd_euclidean(benchmark, pair, expected):
 def test_gcd_euclidean_divmod(benchmark, pair, expected):
     assert is_positive_integer(*pair) is True
     result = benchmark(gcd_euclidean_divmod, *pair)
-    assert result == expected
+    assert expected == result
 
 
 @pytest.mark.benchmark(group="gcd_extended_euclidean")
@@ -36,7 +36,7 @@ def test_gcd_euclidean_divmod(benchmark, pair, expected):
 def test_gcd_extended_euclidean(benchmark, pair, expected):
     assert is_positive_integer(*pair) is True
     result = benchmark(gcd_extended_euclidean, *pair)
-    assert result == expected
+    assert expected == result
 
 
 def is_positive_integer(a: int, b: int) -> bool:

python-algorithm/algorithm/math/test_least_common_multiple.py

@@ -12,7 +12,7 @@
 def test_lcm(benchmark, pair, expected):
     assert is_positive_integer(*pair) is True
     result = benchmark(lcm, *pair)
-    assert result == expected
+    assert expected == result
 
 
 def is_positive_integer(a: int, b: int) -> bool:

python-algorithm/algorithm/search/test_binary_search.py

@@ -10,4 +10,4 @@
 ], ids=["successful1", "successful2"])
 def test_binary_search(benchmark, sequence, target, expected):
     result = benchmark(binary_search, sequence, target)
-    assert result == expected
+    assert expected == result

python-algorithm/algorithm/search/test_linear_search.py

@@ -10,4 +10,4 @@
 ], ids=["successful1", "successful2"])
 def test_linear_search(benchmark, sequence, target, expected):
     result = benchmark(linear_search, sequence, target)
-    assert result == expected
+    assert expected == result

python-algorithm/algorithm/string/test_naive_string_matcher.py

@@ -9,4 +9,4 @@
 ], ids=["successful"])
 def test_naive_string_matcher(benchmark, text, pattern, expected):
     result = benchmark(naive_string_matcher, text, pattern)
-    assert result == expected
+    assert expected == result

python-algorithm/requirements.txt

@@ -2,4 +2,3 @@ numpy>=1.24.1
 scipy>=1.10.0
 pytest>=7.2.0
 pytest-benchmark>=4.0.0
-sortedcontainers>=2.4.0