match-sorter - Simple, expected, and deterministic best-match sorting of an array in JavaScript

  •        18

This follows a simple and sensible (user friendly) algorithm that makes it easy for you to filter and sort a list of items based on given input. Items are ranked based on sensible criteria that result in a better user experience.

https://github.com/kentcdodds/match-sorter#readme
https://github.com/kentcdodds/match-sorter

Dependencies:

diacritic : 0.0.2

Tags
Implementation
License
Platform

   




Related Projects

sifter

  •    Javascript

Sifter is a client and server-side library (via UMD) for textually searching arrays and hashes of objects by property – or multiple properties. It's designed specifically for autocomplete. The process is three-step: score, filter, sort. Seaching will provide back meta information and an "items" array that contains objects with the index (or key, if searching a hash) and a score that represents how good of a match the item was. Items that did not match will not be returned.

Shuffle - Categorize, sort, and filter a responsive grid of items

  •    Javascript

Categorize, sort, and filter a responsive grid of items. This project was inspired by Isotope and Packery.

Sorting Algorithm Visualization

  •    

Sorting Algorithm Visualization Displays Bead Sort, Binary Tree Sort, Bubble Sort, Bucket Sort, Cocktail Sort, Counting Sort, Gnome Sort, In Place Merge Sort, Insertion Sort, Merge Sort and more...

mixitup - A CSS3 and jQuery Filter & Sort Plugin

  •    Javascript

A CSS3 and jQuery Filter & Sort Plugin

isotope - :revolving_hearts: Filter & sort magical layouts

  •    HTML

See isotope.metafizzy.co for complete docs and demos.Link directly to Isotope files on unpkg.


mixitup - A high-performance, dependency-free library for animated filtering, sorting, insertion, removal and more

  •    Javascript

MixItUp is a high-performance, dependency-free library for animated DOM manipulation, giving you the power to filter, sort, add and remove DOM elements with beautiful animations. MixItUp plays nice with your existing HTML and CSS, making it a great choice for responsive layouts and compatible with inline-flow, percentages, media queries, flexbox and more.

Card Sort

  •    Java

Card sort research has applications in psychology, web development, and market research. Here, we offer a digital card sorting tool with a simple, user friendly interface and powerful analysis tools. We concentrate on a flexible, multi-purpose sort.

Python - All Algorithms implemented in Python

  •    Python

These are for demonstration purposes only. There are many implementations of sorts in the Python standard library that are much better for performance reasons. From Wikipedia: Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.

Simple Merge Sort

  •    

This is a simple implementation of Merge-Sort, using to sort an Array of Integers.

Tablesorter -Flexible client-side table sorting

  •    javascript

Tablesorter is a jQuery plugin for turning a standard HTML table with THEAD and TBODY tags into a sortable table without page refreshes. tablesorter can successfully parse and sort many types of data including linked data in a cell.

thenBy.js - thenBy is a javascript micro library that helps sorting arrays on multiple keys

  •    Javascript

thenBy is a javascript micro library that helps sorting arrays on multiple keys. It allows you to use the native Array::sort() method of javascript, but pass in multiple functions to sort that are composed with firstBy().thenBy().thenBy() style. If an element doesn't have the property defined, it will sort like the empty string (""). Typically, this will be at the top.

WikiSort - Fast and stable sort algorithm that uses O(1) memory. Public domain.

  •    C++

Update (04/28/14): Check out the GrailSort project on GitHub for a similar algorithm based on a paper by Huang and Langston. It's actually faster than WikiSort for the Random and RandomFew tests when you remove the 512-item cache! It goes to show that this is still an open area of research that could use your expertise. WikiSort is an implementation of "block merge sort", or "block sort" for short, which is a stable merge sort based on the work described in "Ratio based stable in-place merging", by Pok-Son Kim and Arne Kutzner [PDF].

list

  •    Javascript

The perfect library for adding search, sort, filters and flexibility to tables, lists and various HTML elements. Built to be invisible and work on existing HTML.

Image Manager

  •    

Image Manager is a utility application designed to view and manage image archives. Comes with a powerful file sort tool that has many different methods to sort, rename, and other advanced file management functions.

laravel-query-builder - Easily build Eloquent queries from API requests

  •    PHP

This package allows you to filter, sort and include eloquent relations based on a request. The QueryBuilder used in this package extends Laravel's default Eloquent builder. This means all your favorite methods and macros are still available. Query parameter names follow the JSON API specification as closely as possible. Have a look at the usage section below for advanced examples and features.

sort - BSD sort(1)

  •    C

Faster and BSD licenced implementation of sort(1) utility. Uses radixsort. Originally written for 4.3BSD, bashed into shape on NetBSD.

Thunderbird No Message Pane Sort

  •    Javascript

No Message Pane Sort is an extension for Mozilla Thunderbird. It prevents accidental resorting of the message pane by disabling mouse button clicks on the column headers. It is still possible to consciously sort messages via the View menu.

interview - Data Structures and Algorithms in Java (useful in interview process)

  •    Java

Very useful in interview process for Java Software Development Engineer (SDE). The loop executes N times, so the sequence of statements also executes N times. If we assume the statements are O(1), the total time for the for loop is N * O(1), which is O(N) overall.

bootstrap-table - An extended Bootstrap table with radio, checkbox, sort, pagination, and other added features

  •    Javascript

An extended Bootstrap table with radio, checkbox, sort, pagination, extensions and other added features. NOTE: Bootstrap Table is licensed under the The MIT License. Completely free, you can arbitrarily use and modify this plugin. If this plugin is useful to you, you can Star this repo, your support is my biggest motive force, thanks.