| Data Structures and Algorithm Analysis in Java |
|
This page contains source code for the textbook Data Structures and Algorithm Analysis in Java, by Mark Allen Weiss (Addison-Wesley, 1999).
Submitted: Dec 15, 1999
|
| Data Structures and Algorithms with Object-Oriented Design Patterns in Java |
|
This book is about the fundamentals of data structures and algorithms - the basic elements from which large and complex software artifacts are built. This book also illustrates object-oriented design and it promotes the use of common, object-oriented design patterns. The algorithms and data structures in the book are presented in the Java programming language.
Submitted: Aug 13, 2004
|
| Java Applets For Data Structures and Algorithms |
|
Applets for Recursion, Sorting, Searching, Lists, Stacks and Queues, and Trees and Graphs, by R. Mukundan.
Submitted: Aug 13, 2004
|
| Sorting Algorithms Demo |
|
The following applets chart the progress of several common sorting algorithms while sorting an array of data using in-place algorithms. This means that the algorithms do not allocate additional storage to hold temporary results: they sort the data in place. (This is inspired by the algorithm animation work at Brown University and the video Sorting out Sorting from the University of Toronto (circa 1970!).)
Submitted: Dec 14, 1999
|
| Happy Codings - Programming Code Examples |
|
Programming resources and code examples.
Submitted: Aug 28, 2005
|
| DAJ --- A Toolkit for the Simulation of Distributed Algorithms in Java |
|
This report describes the DAJ toolkit for designing, implementing, testing, simulating and visualizing distributed algorithms in Java. DAJ consists of a Java class library with a simple programming interface that enables the development of distributed algorithms in a message passing model. The resulting programs may be executed in standalone mode using a Java interpreter or embedded as applets into HTML pages and executed by Web browsers. The goal of the toolkit is to provide an universally accessible platform for research and education in the area of distributed algorithms. DAJ is freely available over the World Wide Web.
Submitted: Nov 24, 1999
|
| The Sorting Algorithm Demo |
|
The animations on this page illustrate a number of different sequential and parallel sorting algorithms. The relative execution times of the animations give a very rough idea of the relative speeds of the algorithms. Each algorithm is finished when its colored lines disappear.
Submitted: Dec 14, 1999
|
| SkipList Applet: Demonstration of Skip-Lists |
|
Skip Lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforcing balancing and as a result the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees. Skip lists have first been published by William Pugh.
Submitted: Dec 15, 1999
|
| Knowledge management, Java and knowledge indexing and search |
|
Addition of a XML Thesaurus to Lucene. The addition of a thesaurus specific to the studied domain can bring a great help when searching for documents. Note: this is a french web page describing the corresponding Java applications .
Submitted: Oct 12, 2004
|
| Shellsort |
|
This paper surveys the theoretical and empirical studies that have been done over the past four decades on the Shellsort algorithm and its variants. The discussion includes: upper bounds, including linkages to number-theoretic properties of the algorithm; lower bounds on Shellsort and Shellsort-based networks; average-case results; proposed probabilistic sorting networks based on the algorithm; and a list of open problems.
Submitted: Dec 15, 1999
|
| Efficient Approximative Multiplication of Square Matrices |
|
Open source project files. Subject: (n x n) matrix multiplication with error bounds in O(n^2) time.
Submitted: Jun 10, 2005
|
| Xtango and Polka Algorithm Animation Systems |
|
XTANGO is a general purpose algorithm animation system, developed by John Stasko of Georgia Tech, that supports programmers developing color, real-time, 2 & 1/2 dimensional, smooth animations of their own algorithms and programs. The focus of the system is on ease-of-use. XTANGO utilizes the path-transition animation paradigm which helps move animation design to an abstract, high level. Programmers need not be graphics experts to develop their own animations.
Submitted: Dec 14, 1999
|
| iTechArt Group - Custom software development |
|
iTechArt offers first class .NET Developers, DotNetNuke consulting, Custom Software Development and Outsourcing services
Submitted: Dec 10, 2006
|
|
