Skip to content

Based on the latest Java 25 LTS release, this project demonstrates test examples of popular algorithms such as QuickSort and BubbleSort. The implementation highlights the new features introduced in Java 25, making the code both modern and efficient.

Notifications You must be signed in to change notification settings

balantaim/Algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Data Structures and Algorithms

Description

Based on the latest Java 25 LTS release, this project demonstrates test examples of popular algorithms such as QuickSort and BubbleSort.

The implementation highlights the new features introduced in Java 25, making the code both modern and efficient.

Key Features

  • Java 25 LTS base: All examples are implemented using the new long-term support release.

  • IO.print(): Uses the simplified printing API introduced in Java 25.

  • New Markup Language for Documentation: Replaces the old JavaDoc style with modern markup.

  • Algorithm Tests: Includes implementations of common algorithms with clean and clear examples.

Performance Comparison:

  • Execution time is measured in milliseconds.

  • Comparison between running algorithms on platform threads vs virtual threads.

Requirements

Java 25 LTS or greater

Supported Algorithms

Documentation: Virtual Threads

Gallery

Image

About

Based on the latest Java 25 LTS release, this project demonstrates test examples of popular algorithms such as QuickSort and BubbleSort. The implementation highlights the new features introduced in Java 25, making the code both modern and efficient.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages