feat: usage of ESM modules imports (instead of CommonJS) (#14)

challenges/consecutive-numbers/solutions/c/function/solution.c

@@ -17,7 +17,7 @@ void print_couple(int* numbers, size_t couple_length) {
 
 int main() {
   size_t couple_length;
-  scanf("%ld\n", &couple_length);
+  scanf("%lu\n", &couple_length);
   char* string = input();
   char* token = strtok(string, " ; ");
   size_t numbers_length = 1;

challenges/convert-number-from-base-to-another/solutions/c/function/solution.c

@@ -16,7 +16,7 @@ char* convert_from_base_10_to_base(unsigned long number, unsigned int base) {
   if (number == 0) {
     return "0";
   }
-  int remainders[64] = {};
+  int remainders[64];
   int index = 0;
   while (number > 0) {
     remainders[index] = number % base;

challenges/hello-world/solutions/cpp/function/solution.cpp

@@ -1,9 +1,10 @@
+#include <cstdlib>
 #include <iostream>
 #include <string>
 
 int main() {
-  for (std::string line; std::getline(std::cin, line);) {
-    std::cout << "Hello, " + line + "!" << std::endl;
-  }
-  return 0;
+  std::string line;
+  std::getline(std::cin, line);
+  std::cout << "Hello, " + line + "!\n";
+  return EXIT_SUCCESS;
 }

challenges/sorting-algorithms/solutions/python/bubble-sort/README.md

@@ -0,0 +1,7 @@
+# sorting-algorithms/python/bubble-sort
+
+Created by [@Divlo](https://github.com/Divlo) on 29 June 2021.
+
+| Algorithm                                                   | Best Case   | Average Case | Worst Case  |
+| ----------------------------------------------------------- | ----------- | ------------ | ----------- |
+| [Bubble sort](https://wikipedia.org/wiki/Bubble_sort)       | O(n)        | O(n²)        | O(n²)       |

challenges/sorting-algorithms/solutions/python/bubble-sort/solution.py

@@ -0,0 +1,24 @@
+from typing import List
+import sys
+
+
+def bubble_sort(numbersInput: List[int]) -> List[int]:
+    numbers = list(numbersInput)
+    length = len(numbers)
+    for index_1 in range(length):
+        for index_2 in range(length - index_1 - 1):
+            if numbers[index_2] > numbers[index_2 + 1]:
+                temporary = numbers[index_2]
+                numbers[index_2] = numbers[index_2 + 1]
+                numbers[index_2 + 1] = temporary
+    return numbers
+
+
+numbers: List[int] = []
+for value in sys.stdin:
+    numbers.append(int(value.rstrip('\n')))
+
+numbers = numbers[1:]
+sorted_numbers = bubble_sort(numbers)
+for number in sorted_numbers:
+    print(number)

challenges/sorting-algorithms/solutions/python/insertion-sort/README.md

@@ -0,0 +1,7 @@
+# sorting-algorithms/python/insertion-sort
+
+Created by [@Divlo](https://github.com/Divlo) on 29 June 2021.
+
+| Algorithm                                                   | Best Case   | Average Case | Worst Case  |
+| ----------------------------------------------------------- | ----------- | ------------ | ----------- |
+| [Insertion sort](https://wikipedia.org/wiki/Insertion_sort) | O(n)        | O(n²)        | O(n²)       |

challenges/sorting-algorithms/solutions/python/insertion-sort/solution.py

@@ -0,0 +1,24 @@
+from typing import List
+import sys
+
+
+def insertion_sort(numbersInput: List[int]) -> List[int]:
+    numbers = list(numbersInput)
+    for index_1 in range(1, len(numbers)):
+        current = numbers[index_1]
+        index_2 = index_1 - 1
+        while index_2 >= 0 and numbers[index_2] > current:
+            numbers[index_2 + 1] = numbers[index_2]
+            index_2 -= 1
+        numbers[index_2 + 1] = current
+    return numbers
+
+
+numbers: List[int] = []
+for value in sys.stdin:
+    numbers.append(int(value.rstrip('\n')))
+
+numbers = numbers[1:]
+sorted_numbers = insertion_sort(numbers)
+for number in sorted_numbers:
+    print(number)

challenges/triangle-type/solutions/c/function/solution.c

@@ -15,7 +15,7 @@ char* triangle_type(int triangle_sides[3]) {
 }
 
 int main() {
-  int triangle_sides[3] = {};
+  int triangle_sides[3];
   for (size_t index = 0; index < 3; index++) {
     scanf("%d", &triangle_sides[index]);
   }