Update README.md

Author: JawadSher

13 - Quick Sort Algorithm Problems/README.md

@@ -1 +1,44 @@
+<h1 align='center'>QUICK - SORT - ALGORITHM - PROBLEMS</h1>
+
+<p align='center'>
+Welcome to the 'Quick Sort Problems' repository! This repository contains a collection of problems that focus on the **Quick Sort** algorithm. Quick Sort is a highly efficient sorting algorithm and is widely used due to its O(n log n) average time complexity.
+</p>
+
+## About Quick Sort
+
+Quick Sort is a divide-and-conquer algorithm that works by selecting a pivot element and partitioning the array around the pivot. Elements smaller than the pivot go to the left, and elements greater than the pivot go to the right. The algorithm then recursively applies the same logic to the sub-arrays.
+
+This repository includes various Quick Sort algorithm challenges, such as:
+
+- Understanding the partitioning logic of Quick Sort
+- Solving problems that require sorting with Quick Sort
+- Applying Quick Sort to solve practical problems
+- Optimizing Quick Sort for edge cases
+
+Each problem in this repository is designed to help you understand and implement the Quick Sort algorithm. Whether you're just starting to learn about sorting algorithms or want to deepen your understanding, this collection will help you master Quick 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 Quick Sort and enhance your coding skills!
+
+### Repository Content
+
+<p>
+<img src="https://img.shields.io/badge/problems%20count-01-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/13%20-%20Quick%20Sort%20Algorithm%20Problems/01%20-%20Example)                       | Basic implementation of Quick Sort.                             | Non | Non |
+| 02  | [Quick Sort](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/13%20-%20Quick%20Sort%20Algorithm%20Problems/02%20-%20Quick%20Sort)                     | The standard Quick Sort problem.                                | [Link](https://leetcode.com/problems/sort-an-array/) | [Link](https://www.geeksforgeeks.org/quick-sort/) |
+| 03  | [Quick Sort - Variants](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/13%20-%20Quick%20Sort%20Algorithm%20Problems/03%20-%20Quick%20Sort%20Variants)                          | Quick Sort implementation with variants like Lomuto and Hoare partition schemes. | Non | Non |
+
+Feel free to adjust the introduction based on specific details you would like to add about the repository.
+
+---
+Happy Coding 😊