added README

Author: akshat

CONTRIBUTING.md

@@ -0,0 +1,29 @@
+# Contributing to Efficient Sort Function in JavaScript
+
+Thank you for your interest in contributing to this project! We welcome contributions from the community.
+
+## Getting Started
+
+To contribute, follow these steps:
+
+1. Fork the repository.
+2. Create a new branch for your feature or bug fix: `git checkout -b feature-name`.
+3. Make your changes and commit them: `git commit -m 'Add new feature'`.
+4. Push to the branch: `git push origin feature-name`.
+5. Open a pull request.
+
+## Code Style
+
+Please adhere to the project's coding style and formatting. Use descriptive variable and function names to enhance readability.
+
+## Testing
+
+Ensure that your changes do not break existing functionality. Write tests for new features or bug fixes.
+
+## Reporting Issues
+
+If you encounter any issues or have suggestions, please open an issue on the repository. Provide a clear description of the problem or enhancement.
+
+## License
+
+By contributing to this project, you agree that your contributions will be licensed under the [MIT License](LICENSE)

LEARN.md

@@ -0,0 +1,32 @@
+# Learn about Efficient Sorting
+
+This document provides information and resources to help you understand the efficient sorting function implemented in this project.
+
+## Sorting Algorithms
+
+### Quicksort
+
+Quicksort is an efficient in-place sorting algorithm. It works by selecting a 'pivot' element and partitioning the other elements into two sub-arrays.
+
+### Mergesort
+
+Mergesort is a divide and conquer algorithm that divides the input array into two halves, sorts each half, and then merges the sorted halves.
+
+## How the Sorting Function Works
+
+The sorting function implemented in this project intelligently selects between quicksort and mergesort based on the characteristics of the input array.
+
+### Quick Sort
+
+- Used for smaller arrays (<= 899 elements).
+- Tail-recursive implementation for optimization.
+
+### Merge Sort
+
+- Used for larger arrays (> 899 elements).
+- Recursively splits and merges the array.
+
+## Further Reading
+
+- [Quicksort - Wikipedia](https://en.wikipedia.org/wiki/Quicksort)
+- [Mergesort - Wikipedia](https://en.wikipedia.org/wiki/Merge_sort)

README.md

@@ -0,0 +1,30 @@
+# Efficient Sort Function in JavaScript
+
+[![DeepScan grade](https://deepscan.io/api/teams/23370/projects/26710/branches/851719/badge/grade.svg)](https://deepscan.io/dashboard#view=project&tid=23370&pid=26710&bid=851719)
+[![DeepSource](https://app.deepsource.com/gh/IntegerAlex/efficient-sorting.svg/?label=resolved+issues&show_trend=true&token=Mq0EjM82kW9g-fqGW92fzEBe)](https://app.deepsource.com/gh/IntegerAlex/efficient-sorting/)
+[![CodeScene Code Health](https://codescene.io/projects/51175/status-badges/code-health)](https://codescene.io/projects/51175)
+
+This project provides a JavaScript implementation of an efficient sorting function that dynamically determines the sorting method based on the characteristics of the input array.
+
+## Introduction
+
+The goal of this project is to create a sorting function that intelligently selects the most suitable sorting algorithm based on the size and nature of the input array. By dynamically choosing between quicksort and mergesort, the function aims to optimize performance for different scenarios.
+
+## Usage
+
+```javascript
+npm install efficient-sorting
+```
+
+```javascript
+    import Sort from 'efficient-sorting'
+    let array = [10,20,45,2,1,19,17]
+    console.log(Sort(array))
+```
+
+To use the sorting function in your JavaScript project, follow these steps:
+
+1. Clone the repository:
+
+   ```bash
+   git clone https://github.com/IntegerAlex/efficient-sorting.git