allalgorithms-java's Introduction

The All ▲lgorithms Java library

Why?

Why not 😂??
Clean and focused.
Actively maintained.
Because All Algorithms should be easy to use in Java.

Read the detailed documentation at java.allalgorithms.com. See the All ▲lgorithms Tree.

Want to contribute? GET STARTED HERE

Dependency Information

Download the latest AAR from Maven Central or grab via Gradle:

Maven

<dependency>
        <groupId>com.abranhe.allalgorithms</groupId>
        <artifactId>allalgorithms</artifactId>
        <version>0.0.1</version>
</dependency>

Gradle

compile 'com.abranhe:bigdecimal:0.0.1'

Apache Ivy

<dependency org="com.abranhe" name="allalgorithms" rev="0.0.1" />

Groovy Grape

@Grapes(
  @Grab(group='com.abranhe', module='allalgorithms', version='0.0.1')
)

Apache Builder

'com.abranhe:allalgorithms:jar:0.0.1'

Using it in your project?

import com.abranhe.allalgorithms.*;

Usage

import com.abranhe.allalgorithms.searches.*;

public static void main(String[] args) {
    int[] arr = {7, 2, 1, 19};

    MergeSort.sort(arr);
    // {1, 2, 7, 19}
}

Tree

Math
- Fibonacci
Searches
- Binary Search
Sorting
- Merge Sort
String
- Palindrome Check

allalgorithms-javascript: The All ▲lgorithms Javascript Library
allalgorithms-python: The All ▲lgorithms Python Library

Maintainers


Carlos Abraham

License

MIT License © Carlos Abraham

allalgorithms-java's People

Contributors

Stargazers

Watchers

allalgorithms-java's Issues

Generic implementation of Merge Sort in Java

I have implemented the MergeSort algorithm, in which I have created a void sort(arr) method, that takes the array and sort it, I am repeating code for the method to pass the array parameter of Integers or Doubles. What about String, ... etc

This implementation works so far, but is there any way to implement this generically this algorithm?

Helpful links:

Recommend Projects