What does phishman3579/java-algorithms-implementation do?

This project is a comprehensive suite of Java-based implementations for standard computer science algorithms, data structures, graph analysis, and mathematical computations. It provides a collection of reference implementations for fundamental data containers, including trees, heaps, maps, tries, and lists, alongside common sorting and searching routines.

What are the main features of phishman3579/java-algorithms-implementation?

The main features of phishman3579/java-algorithms-implementation are: Data Structure Implementations, Graph Theory, Custom Data Structure Implementations, Java Implementation References, Algorithm Libraries, Element Search Algorithms, Graph Analysis Algorithms, Sorting Algorithms.

What are some open-source alternatives to phishman3579/java-algorithms-implementation?

Open-source alternatives to phishman3579/java-algorithms-implementation include: amejiarosario/dsa.js-data-structures-algorithms-javascript — This project is a computer science educational resource and library providing implementations of data structures and… loiane/javascript-datastructures-algorithms — This project is a library and educational resource providing implementations of foundational computer science data… xtaci/algorithms — This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides… humanwhocodes/computer-science-in-javascript — This is a collection of classic computer science algorithms and data structures implemented from scratch in… jack-lee-hiter/algorithmsbypython — AlgorithmsByPython is a reference library and educational repository providing runnable Python implementations of… kelvins/algorithms-and-data-structures — This repository is a collection of fundamental computer science algorithms and data structures designed for…

Java Algorithms Implementation - implémenter…

Java Algorithms Implementation - implémenter… | Awesome Repos

Features

Data Structure Implementations - Provides reference implementations of fundamental data structures including trees, heaps, maps, tries, and lists.
Graph Theory - Implements mathematical libraries for modeling and solving problems with nodes and edges.
Custom Data Structure Implementations - Implements custom collections such as tries and heaps with specific complexity guarantees.
Java Implementation References - Offers reference Java implementations of trees, heaps, maps, and lists.
Algorithm Libraries - Provides a comprehensive library of standard computer science algorithms and data structures implemented in Java.
Element Search Algorithms - Provides multiple search implementations including binary, linear, and interpolation search.
Graph Analysis Algorithms - Provides implementations of core graph theory algorithms including shortest paths and minimum spanning trees.
Sorting Algorithms - Implements fundamental sorting algorithms such as quick, merge, heap, and radix sorts.
Sorting and Searching Implementations - Provides comprehensive implementations of essential sorting and searching routines like quicksort and binary search.
Linked Data Structures - Builds non-linear structures like trees and graphs using object references to connect nodes.
Memoization - Implements memoization to optimize recursive sequence problems and avoid redundant calculations.
Text String Manipulation Utilities - Provides utilities for string processing, including palindrome detection, edit distance, and character reversal.
Algorithm Implementation Workflows - Demonstrates proven Java patterns for building efficient sorting, searching, and string manipulation features.
Algorithm Implementations - Provides practical code implementations of classic computer science routines and design patterns.
Computer Science Education - Serves as a learning resource for fundamental algorithms and data structures via Java implementations.
Dynamic Programming Sequence Analysis - Implements sequence analysis capabilities for identifying common subsequences and increasing patterns using dynamic programming.
Dynamic Programming - Uses dynamic programming to optimize complex sequence problems and mathematical computations.
Mathematical Utilities - Implements advanced mathematical utilities including prime testing, modular arithmetic, and Fast Fourier Transforms.
Mathematical Computing Libraries - Provides mathematical routines for prime testing, modular arithmetic, and Fast Fourier Transforms.

Alternatives open source à Java Algorithms Implementation

Projets open source similaires, classés selon le nombre de fonctionnalités partagées avec Java Algorithms Implementation.

amejiarosario/dsa.js-data-structures-algorithms-javascript
amejiarosario/dsa.js-data-structures-algorithms-javascript
7,768Voir sur GitHub
This project is a computer science educational resource and library providing implementations of data structures and algorithms in JavaScript. It serves as an algorithm implementation reference and a toolkit for building foundational data containers, including a collection of sorting algorithms and a guide for learning time and space complexity. The project differentiates itself by pairing class-based implementations with Big O analysis to illustrate asymptotic complexity. It includes a non-linear data structure toolkit featuring self-balancing trees, hash maps, and graphs, alongside comparis
JavaScriptalgorithmalgorithmsbook
Voir sur GitHub7,768
loiane/javascript-datastructures-algorithms
loiane/javascript-datastructures-algorithms
4,862Voir sur GitHub
This project is a library and educational resource providing implementations of foundational computer science data structures and algorithms written in JavaScript and TypeScript. It serves as a reference for executing standard sorting, searching, and recursive patterns using modern web technologies. The collection includes typed implementations for both basic containers, such as stacks, queues, and linked lists, and advanced organizational patterns, including trees, heaps, tries, and graphs. The material covers algorithmic analysis and problem solving through the use of Big O notation to eva
JavaScriptalgorithmavl-treebinary-tree
Voir sur GitHub4,862
xtaci/algorithms
xtaci/algorithms
5,454Voir sur GitHub
This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides a suite of tools for general algorithm implementation, including data structure management, graph theory analysis, and string processing. The library is distinguished by its specialized toolkits for cryptographic hashing and encoding, featuring implementations of MD5, SHA-1, and Base64. It also includes advanced capabilities for high-performance string processing via suffix trees and arrays, as well as computational number theory for primality testing and arbitrary-precision
C++
Voir sur GitHub5,454
humanwhocodes/computer-science-in-javascript
humanwhocodes/computer-science-in-javascript
9,119Voir sur GitHub
This is a collection of classic computer science algorithms and data structures implemented from scratch in JavaScript. The project provides reference implementations of fundamental concepts including sorting algorithms, binary search, linked lists, and binary search trees, all built as standalone pure functions with no external dependencies. The implementations cover a range of data structures, including singly-linked, doubly-linked, and circular linked lists with full traversal and mutation operations, as well as binary search trees supporting insertion, deletion, and search. Sorting algori
JavaScript
Voir sur GitHub9,119

Voir les 30 alternatives à Java Algorithms Implementation

phishman3579java-algorithms-implementation