npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

logan-sorting-algorithms-js

v1.0.30

Published

Examples of Various Sorting Algorithms with Drawn Out Explinations

Downloads

32

Readme

Sorting Algorithms with Explinations of Bubble, and Selection - By Logan.

1. bubbleSortExample(ArrayToBeSorted)

  • Takes one argument, your number array, sorts it, slowly
  • Bubble Sort is never recommended, but very easy to implement
  • Legend has it network television used this for sorting programming. Think of it as that level of speed.
  • Numbers Bubble Up. Largest numbers slowly migrate up the array indices.

2. selectionSort(ArrayToBeSorted)

  • Takes one argument of number array.
  • Selection Sort is in place so even if it isn't the fastest for something large, it has simple space requirements.
  • Recommended for general use.

3. mergeSort(ArrayToBeSorted)

  • Takes one argument, yournumber array, sorts it, at decent speed.
  • This is used commonplace when data is large enough loading data is an issue.
  • This sort tends to be used externally, i.e. not-in-place
  • We follow the divide and conquer principle.
  • Sorting is easier one at a time, from the ground up.
  • Small arrays may be slower than necessary

Bubble Sort Code (Swap Included in Package):

function bubblesort(ArrayToBeSorted) { for ( let i = 0; i < ArrayToBeSorted.size - 1; i++; ) { for ( let j = 0; j < ArrayToBeSorted - ArrayToBeSorted.size - 1; j++ ) { if (ArrayToBeSorted[j] > ArrayToBeSorted[j+1]) { Swap (ArrayToBeSorted , j , j+1) } } } }

function selectionSort(ArrayToBeSorted) { var i, j, min var n = ArrayToBeSorted.length; for ( i = 0; i < n; i++; ) { min = i; for ( j = i+1; j < n; j++) { if ( ArrayToBeSorted[j] < ArrayToBeSorted[min]) { min = j; } } if (min != i) { swap(ArrayToBeSorted, i, min) } } }

function mergeSort(ArrayToBeSorted, left, right) { if ( left >= right) { return; // Returns recursively } var middle = left + parseInt((right - left)/2); mergeSort(ArrayToBeSorted, left, middle); mergeSort(ArrayToBeSorted, middle+1, right); merge(ArrayToBeSorted, left, middle, right); }