integeralex/efficient-sorting

A simple , efficient and es6 way to sort an array using quick sort and merge sort

Efficient Sort Function in JavaScript

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.

• For now it only supports 1D array of any size

Installation

Install the efficient-sorting package using npm:

npm install efficient-sorting

Usage

    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:

   git clone https://github.com/IntegerAlex/efficient-sorting.git

efficient-sorting's Issues

(JS-0242) Use `const` declarations for variables that are never reassigned

Description

Variables that are never re-assigned a new value after their initial declaration should be declared with the const keyword. This prevents the programmer from erroneously re-assigning to a read-only variable, and informs those reading the code that a variable is a constant value.

Occurrences

There is 1 occurrence of this issue in the repository.

See all occurrences on DeepSource → app.deepsource.com/gh/IntegerAlex/efficient-sorting/issue/JS-0242/occurrences/