Are you happy with your logging solution? Would you help us out by taking a 30-second survey? Click here

Java

All Algorithms implemented in Java

Subscribe to updates I use Java


Statistics on Java

Number of watchers on Github 2656
Number of open issues 140
Main language Java
Average time to merge a PR 1 day
Open pull requests 38+
Closed pull requests 32+
Last commit over 1 year ago
Repo Created about 3 years ago
Repo Last Updated over 1 year ago
Size 304 KB
Organization / Authorthealgorithms
Contributors5
Page Updated
Do you use Java? Leave a review!
View open issues (140)
View on github
Fresh, new opensource launches 🚀🚀🚀
Trendy new open source projects in your inbox! View examples

Subscribe to our mailing list

Evaluating Java for your project? Score Explanation
Commits Score (?)
Issues & PR Score (?)

The Algorithms - Java Build Status

All algorithms implemented in Java (for education)

These are for demonstration purposes only. There are many implementations of sorts in the Java standard library that are much better for performance reasons.

Sort Algorithms

Bubble

alt text

From Wikipedia: Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.

Properties

  • Worst case performance O(n2)
  • Best case performance O(n)
  • Average case performance O(n2)
View the algorithm in action

Insertion

alt text

From Wikipedia: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.

Properties

  • Worst case performance O(n2)
  • Best case performance O(n)
  • Average case performance O(n2)
View the algorithm in action

Merge

alt text

From Wikipedia: In computer science, merge sort (also commonly spelt mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945.

Properties

  • Worst case performance O(n log n)
  • Best case performance O(n)
  • Average case performance O(n)
View the algorithm in action

Quick

alt text

From Wikipedia: Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.

Properties

  • Worst case performance O(n2)
  • Best case performance O(n log n) or O(n) with three-way partition
  • Average case performance O(n2)
View the algorithm in action

Selection

alt text

From Wikipedia: The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.

Properties

  • Worst case performance O(n2)
  • Best case performance O(n2)
  • Average case performance O(n2)
View the algorithm in action

Shell

alt text

From Wikipedia: Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The idea is to arrange the list of elements so that, starting anywhere, considering every nth element gives a sorted list. Such a list is said to be h-sorted. Equivalently, it can be thought of as h interleaved lists, each individually sorted.

Properties

  • Worst case performance O(nlog2 2n)
  • Best case performance O(n log n)
  • Average case performance depends on gap sequence
View the algorithm in action

Time-Compexity Graphs

Comparing the complexity of sorting algorithms (Bubble Sort, Insertion Sort, Selection Sort)

Complexity Graphs


Search Algorithms

Linear

alt text

From Wikipedia: linear search or sequential search is a method for finding a target value within a list. It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched. The linear search runs in at the worst linear time and makes at most n comparisons, where n is the length of the list.

Properties

  • Worst case performance O(n)
  • Best case performance O(1)
  • Average case performance O(n)
  • Worst case space complexity O(1) iterative

Binary

alt text

From Wikipedia: Binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half until it is successful.

Properties

  • Worst case performance O(log n)
  • Best case performance O(1)
  • Average case performance O(log n)
  • Worst case space complexity O(1)

From Wikipedia: Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The idea is to arrange the list of elements so that, starting anywhere, considering every nth element gives a sorted list. Such a list is said to be h-sorted. Equivalently, it can be thought of as h interleaved lists, each individually sorted.

Properties

  • Worst case performance O(nlog2 2n)
  • Best case performance O(n log n)
  • Average case performance depends on gap sequence
View the algorithm in action
Java open issues Ask a question     (View All Issues)
  • over 2 years isempty method and variables issues in heap programs
Java open pull requests (View All Pulls)
  • Stack List Implementation
  • Added base conversions.
  • Solves issue #304
  • Resolve the conflict of closed PR #146
  • Added Triple DES algorithm
  • CSVFile --- class
  • Added Other BFS, DFS
  • Add Double Ended Heap
  • add upstairs algorithm
  • Added Modular Exponential
  • Create OctalToHexadecimal.java
  • [PR] New Algorithms - Matrix Chain Multiplication
  • insert scalar divide function
  • Add Advanced Encryption Standard
  • Add Edmond's algorithm for maximum flow
  • add function divide
  • Loopinvariant
  • Added Ring Queue(=Circular Queue)
  • Add connected components algorithm
  • add DEAP(double-ended heap)
  • implement SkylineProblem
  • Scheduling to Minimize Lateness ( Greedy Algorithm )
  • I made new mergesort
  • add FizzBuzz
  • Add BellmanFord graph algorithm
  • Add LinkedList structure and variations
  • add coinChange algo
  • Odd Even Sort
  • Add Sorting algorithm QuickSortMedianOfThree
  • Add FloydWarshall graph algo.
  • AES Encryption/Decryption
  • Added peekFront and peekBack functions
  • Added Miller-Rabin primality test
  • Suffix Tree implementation
  • [modified] merge sort complexities
  • resolve the conflict
  • Circular Queue
  • Added Bucket Sort
Java questions on Stackoverflow (View All Questions)
  • Deploy a Java app on FX7500 RFID reader
  • retrieve multiple rows for single column from db resultset java
  • using R programming in java
  • hard disk is showing full by java program
  • Java android Fragment ActionBar witJava android FloatingActionButton set Image on full FloatingActionButton sizeh styles :NoActionBar
  • How to convert ISO 8601 Datetime into a specific datetime format in Java using Joda package
  • How to enable / disable buttons in java, eclipse?
  • What happened to swing labs or swingx-ws? JXMapKit for Java
  • Why can't we throw exception inside Java 8 stream?
  • Send a String from Android to java server(heroku)
  • Java: Calling values from another class
  • How to access protected field of a super class in java from subclasses?
  • problems with exception in java app
  • Java create DKIM with jDKIM
  • Java: converting string to specific locale
  • I am new for Regular Expression validation in java. Need to validate by position
  • Java regex to find a specific substring without alpha numeric characters before or after it
  • Unable to receive SNMPv3 Traps few times after the first Send. [snmp4j-Java]
  • Is there any possible way to get version of an Web application either Selenium or Java?
  • java multipart connection server
  • How can I write column wise into a file in java?
  • Java Regex inconsistent groups
  • java - why not parse http to Map?
  • Java varargs method overloading compiler error - ambiguity?
  • Selenium Java error
  • Multiplying nth character in Java String by 2 using stream and reduce?
  • How could i show arabic numbers in java tableview int column and make integer sort over it?
  • InstallAnywhere - Uninstallation Java Error : java.lang.IllegalArgumentException: No product for ID=
  • Is there any alternative to use of this in static context in java
  • Why change height and width values in JFrame on minimize and maximize and resize in java
Java list of languages used
Other projects in Java