Home  |  About Us  |  Link To Us  |  FAQ  |  Contact

Bubble Sort Algorithm freeware
Filter: All | Freeware | Demo

# Bubble Sort Algorithm

Added: June 22, 2010 | Visits: 569

Sort::Radix is a Perl module with multiple passes distribution sort algorithm. SYNOPSIS use Sort::Radix; @array = qw(flow loop pool Wolf root sort tour); radix_sort(@array); print "@arrayn"; This is an implementation based on Jarkkos Wolf book (Mastering Algorithms with Perl, pp....

Platforms: *nix

Released: June 16, 2012  |  Added: June 16, 2012 | Visits: 314

Sorts Calculator is a small, easy to use application specially designed to help you sort random array. The sorts offered include select sort, bubble sort, quick sort, merge sort and heap sort. for WindowsAll

Platforms: Windows

Added: July 07, 2013 | Visits: 303

Have you ever thought about the fastest way to sort N numbers?Last week I wrote a post about the fastest way to sort 3 numbers, this week I show you a tricky way to optimize the sort of N numbers.The problem of sorting an array of numbers is probably the most studied in computer science. The...

Platforms: Matlab

Released: July 12, 2012  |  Added: July 12, 2012 | Visits: 191

WordSort was designed using C# as an algorithm for string sorting with linear complexity. Based on the partial hashing approach, the algorithm provides a higher performance than classical algorithms that use the comparison. WordSort includes an easy and intuitive console application that...

Platforms: Windows

Added: October 08, 2013 | Visits: 217

Visual Sorting is a free and easy to use program created to illustrate the difference between selection sort and insertion sort algorithm. Visual Sorting is written in the Java programming language.

Platforms: Mac

Added: February 19, 2010 | Visits: 639

Algorithm::SISort is a Perl module that contains select and insert sorting algorithm. SYNOPSIS use Algorithm::SISort qw(Sort Sort_inplace); @sorted_list = Sort {\$_[0] <=> \$_[1]} @unsorted_list; # ... or ... \$number_of_comparisons = Sort_inplace {\$_[0] <=> \$_[1]} @unsorted_list; This...

Platforms: *nix

Released: August 17, 2012  |  Added: August 17, 2012 | Visits: 232

HeapSort is a fast internal sort written in Java that uses a sorting algorithm analogous to power struggles for higher positions in a hierarchical bureaucracy. It sorts using a comparison routine you provide to compare two elements to be sorted. You can test it with: java.exe...

Platforms: Windows, XP, Windows Vista

Added: April 09, 2010 | Visits: 626

Algorithm::Loops is a Perl module with looping constructs: NestedLoops, MapCar*, Filter, and NextPermute*. SYNOPSYS use Algorithm::Loops qw( Filter MapCar MapCarU MapCarE MapCarMin NextPermute NextPermuteNum NestedLoops ); my @copy= Filter {tr/A-Z.,"()/a-z/d} @list; my \$string= Filter...

Platforms: *nix

Added: March 23, 2010 | Visits: 720

Sort::Versions is a Perl 5 module for sorting of revision-like numbers. SYNOPSIS use Sort::Versions; @l = sort { versioncmp(\$a, \$b) } qw( 1.2 1.2.0 1.2a.0 1.2.a 1.a 02.a ); ... use Sort::Versions; print lower if versioncmp(1.2, 1.2a) == -1; ... use Sort::Versions; %h = (1 => d, 2...

Platforms: *nix

Added: March 20, 2010 | Visits: 1.865

Algorithm::LUHN is a Perl module to calculate the modulus 10 double add double checksum. SYNOPSIS use Algorithm::LUHN qw/check_digit is_valid/; \$c = check_digit("43881234567"); print "It worksn" if is_valid("43881234567\$c"); \$c = check_digit("A2C4E6G8"); # this will cause an error...

Platforms: *nix

Added: January 18, 2010 | Visits: 845

Sort::Half::Maker is a Perl module to create half-sort subs easily. SYNOPSIS use Sort::Half::Maker qw(make_halfsort); \$sub = make_halfsort( start => [ qw(x y z) ], end => [ qw(a b c) ], fallback => sub { \$_[0] cmp \$_[1] }, ); @list = sort \$sub qw(a y f h w z b t x); # qw(x y z f h t w...

Platforms: *nix

Added: January 18, 2010 | Visits: 745

Algorithm::Dependency is a base class for implementing various dependency trees. SYNOPSIS use Algorithm::Dependency; use Algorithm::Dependency::Source::File; # Load the data from a simple text file my \$data_source = Algorithm::Dependency::Source::File->new( foo.txt ); # Create the...

Platforms: *nix

Added: October 17, 2010 | Visits: 1.783

Algorithm::Knapsack is a brute-force algorithm for the knapsack problem. SYNOPSIS use Algorithm::Knapsack; my \$knapsack = Algorithm::Knapsack->new( capacity => \$capacity, weights => @weights, ); \$knapsack->compute(); foreach my \$solution (\$knapsack->solutions()) { foreach my \$index...

Platforms: *nix

Added: March 22, 2010 | Visits: 585

Algorithm::DiffOld is a Perl module to compute `intelligent differences between two files / lists but use the old (<=0.59) interface. NOTE This has been provided as part of the Algorithm::Diff package by Ned Konz. This particular module is ONLY for people who HAVE to have the old interface,...

Platforms: *nix

Added: April 26, 2010 | Visits: 600

Algorithm::Diff::Apply is a Perl module to apply one or more Algorithm::Diff diffs. SYNOPSIS ## Single-diff form: use Algorithm::Diff::Apply qw{apply_diff}; my @ary = ...; my @diff = ...; # some call to Algorithm::Diff::diff() my @changed_ary = apply_diff(@ary, @diff); my \$changed_ary =...

Platforms: *nix

Added: May 06, 2010 | Visits: 1.657

Parallel Genetic Algorithm Library (or PGAL for short) is a C++ toolkit for simply, efficiently, and swiftly producing genetic algorithm code that works across multiple processors. This is useful not only for those with multi-processor computers, but also for distributed and cluster computing...

Platforms: *nix

Added: November 17, 2010 | Visits: 661

sortdemo project is a tool for sorting algorithm demonstrations. Sortdemo generates sequences of image files (GIF or PNG) to visualize the steps of sorting algorithms. It supports insertion, selection, bubble (4 variations), and quick sorts. The nature and the size of the initial list can be...

Platforms: *nix

Added: January 17, 2010 | Visits: 752

Algorithm::BinPack is a Perl module that can efficiently pack items into bins. SYNOPSIS Algorithm::BinPack efficiently packs items into bins. The bins are given a maximum size, and items are packed in with as little empty space as possible. An example use would be backing up files to CD,...

Platforms: *nix

Added: October 17, 2010 | Visits: 747

File::Sort is a Perl module to sort a file or merge sort multiple files. SYNOPSIS use File::Sort qw(sort_file); sort_file({ I => [qw(file_1 file_2)], o => file_new, k => 5.3,5.5rn, -t => | }); sort_file(file1, file1.sorted); This module sorts text files by lines (or records)....

Platforms: *nix