Update README.md

Author: JawadSher

12 - Merge Sort Algorithm Problems/README.md

@@ -1 +1,44 @@
+<h1 align='center'>MERGE - SORT - ALGORITHM - PROBLEMS</h1>
 
+<p align='center'>
+Welcome to the 'Merge Sort Problems' repository! This repository contains a collection of problems that focus on the **Merge Sort** algorithm. Merge Sort is a classic **divide-and-conquer** algorithm that is widely used to sort data efficiently in O(n log n) time.
+</p>
+
+## About Merge Sort
+
+Merge Sort is a well-known algorithm in computer science used to sort arrays and lists. It works by recursively dividing the array into two halves, sorting each half, and then merging the sorted halves back together. The key advantage of Merge Sort is its predictable O(n log n) time complexity, which makes it more efficient for large datasets compared to other sorting algorithms like Bubble Sort or Insertion Sort.
+
+This repository includes various Merge Sort algorithm challenges, such as:
+
+- Understanding the working of Merge Sort
+- Solving problems that require sorting
+- Counting inversions using Merge Sort
+- Applying Merge Sort in different problem contexts
+
+Each problem in this repository is designed to help you understand and implement the Merge Sort algorithm. Whether you're a beginner or looking to refine your knowledge of sorting algorithms, this collection will help you gain expertise in applying Merge Sort.
+
+## Problem List
+
+Here you will find a list of problems organized by topic. For each problem, you'll find **Leetcode** and **GFG** links (where available), along with descriptions and solutions.
+
+Start solving and exploring to improve your understanding of Merge Sort and enhance your coding skills!
+
+### Repository Content
+
+<p>
+<img src="https://img.shields.io/badge/problems%20count-02-orange?logo=leetcode" alt="LeetCode">
+<img src="https://img.shields.io/badge/problems%20count-01-darkgreen?logo=geeksforGeeks" alt="GeeksforGeeks">
+<img src="https://img.shields.io/badge/total%20problems%20count-03-blue" alt="Problem Count"> 
+</p>
+
+
+| No  | Problem Name                          | Description                                                      | Leetcode | GFG |
+|-----|----------------------------------------|------------------------------------------------------------------|----------|-----|
+| 01  | [Example](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/12%20-%20Merge%20Sort%20Algorithm%20Problems/01%20-%20Example)                       | Basic implementation of Merge Sort.                             | Non | Non |
+| 02  | [Merge Sort](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/12%20-%20Merge%20Sort%20Algorithm%20Problems/02%20-%20Merge%20Sort)                     | The standard Merge Sort problem.                                | [Link](https://leetcode.com/problems/sort-an-array/) | [Link](https://www.geeksforgeeks.org/merge-sort/) |
+| 03  | [Count Inversions](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/12%20-%20Merge%20Sort%20Algorithm%20Problems/03%20-%20Count%20Inversions)                          | Count the number of inversions in an array using Merge Sort.      | [Link](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | Non |
+
+Feel free to adjust the introduction based on specific details you would like to add about the repository.
+
+---
+Happy Coding 😊