fixed readmes

2023_09_18/maximum_subarray/README.md

@@ -6,8 +6,14 @@ At each index, the algorithm compares the current element with the maximum sum e
 
 The algorithm also keeps track of the maximum sum seen so far, which is the maximum of all the maximum sums ending at each index. The final result is the maximum sum seen so far.
 
+### Complexity
 
-### Coding
+- **Time Complexity:** `O(n)` `
+- **Space Complexity:** `O(1)`
+
+---
+
+### Solution in Rust
 ```rust
 fn max_sub_array(nums: &[i32]) -> i32 {
     let mut max_ending_here = nums[0];

2023_09_18/maximum_subarray/src/main.rs

@@ -17,6 +17,6 @@ fn max_sub_array(nums: &[i32]) -> i32 {
 
 fn main() {
     let nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4];
-    let res = maxSubArray(&nums);
+    let res = max_sub_array(&nums);
     println!("{}", res);
 }