Simulates and represents some of the traditional sequential sorting algorithms. Developed some contributed algorithms by merging two or more algorithms, or by applying parallel programming concepts by dividing the sorting task into small tasks and distributing them between available processors equally without any conflict between them to get better results.
The base class of all sorting algorithm has set of methods that help counting the comparisons and swaps operations, in addition to calculate the time complexity of each step by adding time unit(s) to the algorithm complexity.
Applet interfaces are used to clarify and demonstrate each algorithm sorting mechanism, also more than one Applet can be used in a single page to compare different algorithms.
• Use Applet to simulate sorts algorithms.
• Implements a multi-threaded algorithm, that calculate the time and space complexity.
Issued and bugs are tracked on github.com.
Waiting for your contributions
Apache License
Copyright (C) 2013 Hudhaifa Shatnawi
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.