bitween/merge-sort

There is no license information available for the latest version (dev-master) of this package.

A simple example of a divide and conquer algorithm: merge sort. Example is used to explain the divide and conquer technique.

Maintainers

Details

github.com/BitweenTech/merge-sort

Source

Issues

Installs: 2

Dependents: 0

Suggesters: 0

Security: 0

Stars: 2

Watchers: 1

Forks: 0

Type:project

dev-master 2021-02-15 13:50 UTC

Requires (Dev)

Unknown License f1a66a797bbccf54e3cf89179358e482056e2fe7

phpsortingmerge sortBitweenDivide and conquerFunctional decomposition

This package is auto-updated.

Last update: 2025-03-22 21:28:28 UTC

README

This is a simple example a divide-and-conquer algorithm. It uses the Merge sort algorithm as an example. Using this algorithm in PHP is fairly simple:

    $mergeSort = new Bitween\MergeSort();
    $sortedArray = $mergeSort->sort([ 3, 2, 1]);

    echo $sortedArray === [ 1, 2, 3 ]; // true