Merge branch 'develop'

Author: codejsha

README.md

@@ -13,7 +13,7 @@ This repository is an implementation of algorithms, data structures, and problem
 Each project is configured in specific environments, as described below:
 
 - C++ project: C++20 / [CMake](https://cmake.org/) build / [GNU Scientific Library (GSL)](https://www.gnu.org/software/gsl/), [Google Test](https://google.github.io/googletest/), [Google Benchmark](https://github.com/google/benchmark), [fmt](https://github.com/fmtlib/fmt) packages / [vcpkg](https://github.com/microsoft/vcpkg) package manager
-- Python project: Python 3.11 / [Poetry](https://python-poetry.org/) / [NumPy](https://numpy.org/), [SciPy](https://www.scipy.org/), [NetworkX](https://networkx.org/), [pytest](https://docs.pytest.org/), [pytest-benchmark](https://pytest-benchmark.readthedocs.io/en/latest/) packages
+- Python project: Python 3.11 / [Poetry](https://python-poetry.org/) build / [NumPy](https://numpy.org/), [SciPy](https://www.scipy.org/), [NetworkX](https://networkx.org/), [pytest](https://docs.pytest.org/), [pytest-benchmark](https://pytest-benchmark.readthedocs.io/en/latest/) packages
 - Java project: Java 21 / [Gradle](https://gradle.org/) build / [Guava](https://github.com/google/guava), [JUnit](https://junit.org/), [Java Microbenchmark Harness (JMH)](https://github.com/openjdk/jmh) libraries
 
 ## Table of Contents
@@ -75,7 +75,7 @@ reversed(number_list)   # return an iterator
 number_list.sort()      # in-place
 sorted(number_list)     # return a new list(copy)
 del(number_list[0])     # delete the first element
-del(number_list[0:2])   # removes the slice
+del(number_list[0:2])   # remove the slice
 bisect.bisect_left(number_list, 3), bisect.bisect_right(number_list, 3), bisect.bisect(number_list, 3)
 bisect.insort_left(number_list, 3), bisect.insort_right(number_list, 3), bisect.insort(number_list, 3)
 
@@ -1167,7 +1167,7 @@ list.sort(Comparator.comparingInt(String::length));
 | ----------- | :-----------------: | ------------------------------------------------------------------------------------ |
 | **Best**    |      $O(n^2)$       | if the list is already sorted                                                        |
 | **Worst**   |      $O(n^2)$       | when sorted in ascending order, if you want to sort in descending order (vice versa) |
-| **Average** |      $O(n^2)$       |                                                                                      |
+| **Average** |      $O(n^2)$       | when the input list is in jumbled order                                              |
 
 **Examples**
 

README_ko-KR.md

@@ -13,5 +13,5 @@
 각 프로젝트는 다음과 같은 환경에서 구성되었습니다:
 
 - C++ project: C++20 / [CMake](https://cmake.org/) build / [GNU Scientific Library (GSL)](https://www.gnu.org/software/gsl/), [Google Test](https://google.github.io/googletest/), [Google Benchmark](https://github.com/google/benchmark), [fmt](https://github.com/fmtlib/fmt) packages / [vcpkg](https://github.com/microsoft/vcpkg) package manager
-- Python project: Python 3.11 / [Poetry](https://python-poetry.org/) / [NumPy](https://numpy.org/), [SciPy](https://www.scipy.org/), [NetworkX](https://networkx.org/), [pytest](https://docs.pytest.org/), [pytest-benchmark](https://pytest-benchmark.readthedocs.io/en/latest/) packages
+- Python project: Python 3.11 / [Poetry](https://python-poetry.org/) build / [NumPy](https://numpy.org/), [SciPy](https://www.scipy.org/), [NetworkX](https://networkx.org/), [pytest](https://docs.pytest.org/), [pytest-benchmark](https://pytest-benchmark.readthedocs.io/en/latest/) packages
 - Java project: Java 21 / [Gradle](https://gradle.org/) build / [Guava](https://github.com/google/guava), [JUnit](https://junit.org/), [Java Microbenchmark Harness (JMH)](https://github.com/openjdk/jmh) libraries

cpp-algorithm/src/array/advancing_through.cpp

@@ -5,7 +5,7 @@ auto AdvancingThrough::CanReachEnd(const std::vector<int>& max_advance_steps) ->
     auto furthest_reach_so_far = 0;
     const auto last_index = static_cast<int>(max_advance_steps.size()) - 1;
 
-    for (auto i = 0; i <= furthest_reach_so_far && furthest_reach_so_far < last_index; ++i)
+    for (int i = 0; i <= furthest_reach_so_far && furthest_reach_so_far < last_index; ++i)
     {
         furthest_reach_so_far = std::max(furthest_reach_so_far, max_advance_steps[i] + i);
     }

cpp-algorithm/src/array/arbitrary_precision_integer.cpp

@@ -6,7 +6,7 @@ auto ArbitraryPrecision::PlusOne(std::vector<int> number_array) -> std::vector<i
 {
     ++number_array.back();
 
-    for (auto i = static_cast<int>(number_array.size()) - 1; i > 0 && number_array[i] == 10; --i)
+    for (int i = static_cast<int>(number_array.size()) - 1; i > 0 && number_array[i] == 10; --i)
     {
         number_array[i] = 0;
         ++number_array[i - 1];
@@ -28,13 +28,13 @@ auto ArbitraryPrecision::StringAddition(const std::string& number_string1, const
     const auto larger = size1 >= size2 ? size1 : size2;
     auto sum = std::vector<int>(larger);
 
-    for (auto i = size1 - 1; i >= 0; --i)
+    for (int i = size1 - 1; i >= 0; --i)
     {
         sum[i] += number_string1.at(i) == '1' ? 1 : 0;
     }
 
     auto carry = 0;
-    for (auto i = size2 - 1; i >= 0; --i)
+    for (int i = size2 - 1; i >= 0; --i)
     {
         sum[i] += carry;
         sum[i] += number_string2.at(i) == '1' ? 1 : 0;
@@ -65,9 +65,9 @@ auto ArbitraryPrecision::Multiply(std::vector<int>& number_array1, std::vector<i
     number_array2.front() = std::abs(number_array2.front());
 
     std::vector<int> result(number_array1.size() + number_array2.size(), 0);
-    for (auto i = static_cast<int>(number_array1.size()) - 1; i >= 0; --i)
+    for (int i = static_cast<int>(number_array1.size()) - 1; i >= 0; --i)
     {
-        for (auto j = static_cast<int>(number_array2.size()) - 1; j >= 0; --j)
+        for (int j = static_cast<int>(number_array2.size()) - 1; j >= 0; --j)
         {
             result[i + j + 1] += number_array1[i] * number_array2[j];
             result[i + j] += result[i + j + 1] / 10;

cpp-algorithm/src/array/delete_element.cpp

@@ -10,7 +10,7 @@ auto DeleteElement::DeleteDuplicates(std::vector<int>& numbers) -> std::vector<i
     }
 
     auto write_index = 1;
-    for (auto i = 1; i < static_cast<int>(numbers.size()); ++i)
+    for (int i = 1; i < static_cast<int>(numbers.size()); ++i)
     {
         if (numbers[write_index - 1] != numbers[i])
         {

cpp-algorithm/src/array/dutch_national_flag.cpp

@@ -4,9 +4,9 @@ auto DutchFlag::DutchFlagPartition1(const int pivot_index, std::vector<Color>& a
 {
     const auto pivot = arr[pivot_index];
 
-    for (auto i = 0; i < static_cast<Color>(arr.size()); ++i)
+    for (int i = 0; i < static_cast<Color>(arr.size()); ++i)
     {
-        for (auto j = i + 1; j < static_cast<Color>(arr.size()); ++j)
+        for (int j = i + 1; j < static_cast<Color>(arr.size()); ++j)
         {
             if (arr[j] < pivot)
             {
@@ -15,9 +15,9 @@ auto DutchFlag::DutchFlagPartition1(const int pivot_index, std::vector<Color>& a
             }
         }
     }
-    for (auto i = static_cast<Color>(arr.size()) - 1; i >= 0; --i)
+    for (int i = static_cast<Color>(arr.size()) - 1; i >= 0; --i)
     {
-        for (auto j = i - 1; j >= 0; --j)
+        for (int j = i - 1; j >= 0; --j)
         {
             if (arr[j] > pivot)
             {
@@ -35,7 +35,7 @@ auto DutchFlag::DutchFlagPartition2(const int pivot_index, std::vector<Color>& a
     const auto pivot = arr[pivot_index];
 
     auto smaller = 0;
-    for (auto i = 0; i < static_cast<Color>(arr.size()); ++i)
+    for (int i = 0; i < static_cast<Color>(arr.size()); ++i)
     {
         if (arr[i] < pivot)
         {
@@ -44,7 +44,7 @@ auto DutchFlag::DutchFlagPartition2(const int pivot_index, std::vector<Color>& a
     }
 
     auto larger = static_cast<Color>(arr.size()) - 1;
-    for (auto i = static_cast<Color>(arr.size()) - 1; i >= 0; --i)
+    for (int i = static_cast<Color>(arr.size()) - 1; i >= 0; --i)
     {
         if (arr[i] > pivot)
         {

cpp-algorithm/src/array/enumerate_prime_number.cpp

@@ -8,12 +8,12 @@ auto EnumeratePrime::GeneratePrimes(int n) -> std::vector<int>
     std::deque<bool> is_prime(n + 1, true);
 
     is_prime[0] = is_prime[1] = false;
-    for (auto p = 2; p <= n; ++p)
+    for (int p = 2; p <= n; ++p)
     {
         if (is_prime[p])
         {
             primes.push_back(p);
-            for (auto i = p * 2; i <= n; i += p)
+            for (int i = p * 2; i <= n; i += p)
             {
                 is_prime[i] = false;
             }

cpp-algorithm/src/array/order_element.cpp

@@ -21,7 +21,7 @@ void OrderElement::EvenOdd(std::vector<int>& arr)
 
 auto OrderElement::Rearrange(std::vector<int>& numbers) -> std::vector<int>
 {
-    for (auto i = 1; std::size(numbers); ++i)
+    for (int i = 1; std::size(numbers); ++i)
     {
         if ((!(i % 2) && numbers[i - 1] < numbers[i]) || ((i % 2) && numbers[i - 1] > numbers[i]))
         {

cpp-algorithm/src/array/random_data_sampling.cpp

@@ -6,7 +6,7 @@
 auto RandomDataSampling::OfflineRandomSampling(const int k, std::vector<int>& arr) -> std::vector<int>
 {
     std::default_random_engine seed((std::random_device())());
-    for (auto i = 0; i < k; ++i)
+    for (int i = 0; i < k; ++i)
     {
         std::uniform_int_distribution<int> dist(i, static_cast<int>(arr.size()) - 1);
         std::swap(arr[i], arr[dist(seed)]);

cpp-algorithm/src/array/replace_element.cpp

@@ -5,7 +5,7 @@ auto ReplaceElement::ReplaceAndRemoveString1(std::vector<std::string>& arr, cons
 {
     auto write_index = 0;
     auto a_count = 0;
-    for (auto i = 0; i < static_cast<int>(arr.size()); ++i)
+    for (int i = 0; i < static_cast<int>(arr.size()); ++i)
     {
         if (arr[i] != remove_str)
         {
@@ -41,7 +41,7 @@ auto ReplaceElement::ReplaceAndRemoveString2(std::vector<std::string>& arr, cons
                                              const std::string& remove_str) -> std::vector<std::string>
 {
     std::erase(arr, remove_str);
-    for (auto i = 0; i < static_cast<int>(arr.size()); ++i)
+    for (int i = 0; i < static_cast<int>(arr.size()); ++i)
     {
         if (arr[i] == replace_str)
         {
@@ -55,7 +55,7 @@ auto ReplaceElement::ReplaceAndRemoveString2(std::vector<std::string>& arr, cons
 
 auto ReplaceElement::TelexEncoding(std::vector<std::string>& arr) -> std::vector<std::string>
 {
-    for (auto i = 0; i < static_cast<int>(arr.size()); ++i)
+    for (int i = 0; i < static_cast<int>(arr.size()); ++i)
     {
         if (arr[i] == ".")
         {