awesome-repositories.com
Blog
awesome-repositories.com

Entdecke die besten Open-Source-Repositories mit KI-gestützter Suche.

EntdeckenKuratierte SuchenOpen-Source-AlternativenSelf-hosted SoftwareBlogSitemap
ProjektÜber unsRanking-MethodikPresseMCP-Server
RechtlichesDatenschutzAGB
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·
phishman3579 avatar

phishman3579/java-algorithms-implementation

0
View on GitHub↗
4,530 Stars·1,844 Forks·Java·Apache-2.0·9 Aufrufe

Java Algorithms Implementation

Dieses Projekt ist eine umfassende Sammlung Java-basierter Implementierungen für Standardalgorithmen der Informatik, Datenstrukturen, Graphenanalysen und mathematische Berechnungen. Es bietet eine Reihe von Referenzimplementierungen für grundlegende Datencontainer, darunter Bäume, Heaps, Maps, Tries und Listen, sowie gängige Sortier- und Suchroutinen.

Die Bibliothek enthält eine spezialisierte Suite für die Graphennetzwerkanalyse, die kürzeste Pfade, minimale Spannbäume und maximalen Fluss abdeckt. Zudem bietet sie mathematische Hilfsprogramme für Primzahltests, modulare Arithmetik und Fast Fourier Transforms sowie Textverarbeitungstools für die Palindrom-Erkennung und die Berechnung der Editierdistanz.

Die Codebasis umfasst breitere Funktionsbereiche wie dynamische Programmierung für Sequenzanalysen und eine Vielzahl von Datenorganisationsmustern für die allgemeine Softwareentwicklung und die Informatikausbildung.

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.

Star-Verlauf

Star-Verlauf für phishman3579/java-algorithms-implementationStar-Verlauf für phishman3579/java-algorithms-implementation

KI-Suche

Entdecke weitere awesome Repositories

Beschreibe in einfachen Worten, was du brauchst — die KI bewertet tausende kuratierte Open-Source-Projekte nach Relevanz.

Start searching with AI

Kuratierte Suchen mit Java Algorithms Implementation

Handverlesene Sammlungen, in denen Java Algorithms Implementation vorkommt.
  • Datenstrukturen und Algorithmen
  • Datenstrukturen und Algorithmen
  • Ressourcen zur algorithmischen Komplexitätstheorie

Open-Source-Alternativen zu Java Algorithms Implementation

Ähnliche Open-Source-Projekte, sortiert nach der Anzahl der gemeinsamen Funktionen mit Java Algorithms Implementation.
  • bmaslakov/kotlin-algorithm-clubAvatar von bmaslakov

    bmaslakov/kotlin-algorithm-club

    929Auf GitHub ansehen↗

    This project is a comprehensive library of fundamental computer science algorithms and data structures implemented in Kotlin. It serves as a toolkit for software engineering proficiency, providing a collection of standard computational techniques designed to operate on any data type through the use of language-level generics. The library distinguishes itself by emphasizing educational clarity and type-safe implementation. It utilizes interface-based abstractions to decouple algorithmic logic from specific data structures, while employing recursive problem decomposition and immutable state pat

    Kotlinalgorithmcomputer-sciencedata-structures
    Auf GitHub ansehen↗929
  • amejiarosario/dsa.js-data-structures-algorithms-javascriptAvatar von amejiarosario

    amejiarosario/dsa.js-data-structures-algorithms-javascript

    7,768Auf GitHub ansehen↗

    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
    Auf GitHub ansehen↗7,768
  • loiane/javascript-datastructures-algorithmsAvatar von loiane

    loiane/javascript-datastructures-algorithms

    4,862Auf GitHub ansehen↗

    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
    Auf GitHub ansehen↗4,862
  • arnauddri/algorithmsAvatar von arnauddri

    arnauddri/algorithms

    1,853Auf GitHub ansehen↗

    This repository provides a collection of fundamental computer science algorithms and data structures implemented in Go. It serves as a technical reference and educational resource, offering reusable modules for common computational tasks including data organization, graph analysis, and numerical operations. The library distinguishes itself through the application of idiomatic Go patterns, utilizing generics for type abstraction and interface-driven polymorphism to ensure compile-time type safety. It emphasizes algorithmic efficiency by employing in-place memory mutation to reduce allocations

    Go
    Auf GitHub ansehen↗1,853
    • Alle 30 Alternativen zu Java Algorithms Implementation anzeigen→

    Häufig gestellte Fragen

    Was macht phishman3579/java-algorithms-implementation?

    Dieses Projekt ist eine umfassende Sammlung Java-basierter Implementierungen für Standardalgorithmen der Informatik, Datenstrukturen, Graphenanalysen und mathematische Berechnungen. Es bietet eine Reihe von Referenzimplementierungen für grundlegende Datencontainer, darunter Bäume, Heaps, Maps, Tries und Listen, sowie gängige Sortier- und Suchroutinen.

    Was sind die Hauptfunktionen von phishman3579/java-algorithms-implementation?

    Die Hauptfunktionen von phishman3579/java-algorithms-implementation sind: Data Structure Implementations, Graph Theory, Custom Data Structure Implementations, Java Implementation References, Algorithm Libraries, Element Search Algorithms, Graph Analysis Algorithms, Sorting Algorithms.

    Welche Open-Source-Alternativen gibt es zu phishman3579/java-algorithms-implementation?

    Open-Source-Alternativen zu phishman3579/java-algorithms-implementation sind unter anderem: bmaslakov/kotlin-algorithm-club — This project is a comprehensive library of fundamental computer science algorithms and data structures implemented in… 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… arnauddri/algorithms — This repository provides a collection of fundamental computer science algorithms and data structures implemented in… 0xax/go-algorithms — This library provides a comprehensive collection of fundamental computer science primitives implemented in Go. It… xtaci/algorithms — This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides…