Update README.md

README.md

@@ -24,52 +24,52 @@ Well, I'm quite partial to a good squeeze of fresh lemon juice. It adds just the
 ## Example Output
 
 
->give me some code that is very simple in javascript but would be very difficult in ANSI-C
+give me some code that is very simple in javascript but would be very difficult in ANSI-C
+
+> In JavaScript, functions are first-class values, which means you can assign them to variables, pass them as arguments to other functions, and even nest them inside other functions. This leads to concise and expressive code.
+>
+> Here's an example of a simple recursive function that calculates the factorial of a given number in JavaScript:
+>
+> ```javascript
+> const factorial = n => n === 0 ? 1 : n * factorial(n - 1);
+>
+> console.log(factorial(5)); // Output: 120
+>
+> ```
+>
+> Now, let's try to write an equivalent code snippet in ANSI-C with similar functionality:
+>
+> ```c
+> #include <stdio.h>
+> #define MAX_RECURSION_DEPTH 1000
+> int factorial(int n) {
+>     if (n == 0)
+>         return 1;
+>     else {
+>         int result;
+>         result = factorial(--n);
+>         if (++depth > MAX_RECURSION_DEPTH)
+>             while(1){} // Recursion stack overflow
+>         return n * result;
+>     }
+> }
+> int main() {
+>     int i, result;
+>     int n = 5;
+>     int depth = 0;
+>
+>     result = factorial(n);
+>     printf("Factorial of %d is: %d\n", n, result);
+>     return 0;
+> }
+> ```
+> 
+> As you can see, the ANSI-C code becomes more verbose and has several disadvantages compared to JavaScript:
 >
->> In JavaScript, functions are first-class values, which means you can assign them to variables, pass them as arguments to other functions, and even nest them inside other functions. This leads to concise and expressive code.
->>
->> Here's an example of a simple recursive function that calculates the factorial of a given number in JavaScript:
->>
->> ```javascript
->> const factorial = n => n === 0 ? 1 : n * factorial(n - 1);
->>
->> console.log(factorial(5)); // Output: 120
->>
->> ```
->>
->> Now, let's try to write an equivalent code snippet in ANSI-C with similar functionality:
->>
->> ```c
->> #include <stdio.h>
->> #define MAX_RECURSION_DEPTH 1000
->> int factorial(int n) {
->>     if (n == 0)
->>         return 1;
->>     else {
->>         int result;
->>         result = factorial(--n);
->>         if (++depth > MAX_RECURSION_DEPTH)
->>             while(1){} // Recursion stack overflow
->>         return n * result;
->>     }
->> }
->> int main() {
->>     int i, result;
->>     int n = 5;
->>     int depth = 0;
->>
->>     result = factorial(n);
->>     printf("Factorial of %d is: %d\n", n, result);
->>     return 0;
->> }
->> ```
->> 
->> As you can see, the ANSI-C code becomes more verbose and has several disadvantages compared to JavaScript:
->>
->> 1. Need to define a maximum recursion depth using a constant or an array index, which can lead to hardcoded limits and potential stack overflow issues.
->> 2. The use of preprocessor directives (#define) for defining functions and macros can make the code less readable and harder to understand.
->> 3. The lack of closures in ANSI-C requires using static variables or passing arguments as arguments to nested functions, making the code more verbose and less concise.
->> ```
+> 1. Need to define a maximum recursion depth using a constant or an array index, which can lead to hardcoded limits and potential stack overflow issues.
+> 2. The use of preprocessor directives (#define) for defining functions and macros can make the code less readable and harder to understand.
+> 3. The lack of closures in ANSI-C requires using static variables or passing arguments as arguments to nested functions, making the code more verbose and less concise.
+> ```
 
 ## Merge Details
 ### Merge Method