Merge pull request #376 from kartikay23/main

Updated README file

Author: thepranaygupta

02. Algorithms/01. Arrays/02. Find the maximum and minimum element in an array/README.md

@@ -2,7 +2,7 @@
 ### Editorial Link: https://www.geeksforgeeks.org/maximum-and-minimum-in-an-array/
 
 
-- ## Approach 1: Sort the Array, TC = O(nlog(n))
+- ## Approach 1: Sort the Array, Time Complexity = O(nlog(n))
 ```java
 //User function Template for Java
 
@@ -62,7 +62,7 @@ class Compute
 }
 ```
 
-- ## Approach 3: Tournament Method (Divide and Conquer), TC = O(n) but lesser number of comparisons
+- ## Approach 3: Tournament Method (Divide and Conquer), Time Complexity = O(n), but lesser number of comparisons
 Divide the array into two parts and compare the maximums and minimums of the two parts to get the maximum and the minimum of the whole array.
 ```java
 //User function Template for Java
@@ -122,7 +122,7 @@ class Compute
 ```
 
 
-- ## Approach 4: Compare in Pairs, TC = O(n)
+- ## Approach 4: Compare in Pairs, Time Complexity = O(n)
 If n is odd then initialize min and max as first element. <br>
 If n is even then initialize min and max as minimum and maximum of the first two elements respectively. <br>
 For the rest of the elements, pick them in pairs and compare their maximum and minimum with the current max and min respectively.

02. Algorithms/README.md

@@ -6,7 +6,7 @@
 
 ## **Algorithms :-**
 
- **An algorithm is any approach you use to perform operations on data (like searching, sorting, traversing, etc).**
+ **An algorithm is a step by step procedure to solve logical and mathematical problems. It is any approach you use to perform operations on data (like searching, sorting, traversing, etc).**
 
 <hr>