Skip to content

A Java library for people who want to implement some algorithms quickly.

License

Notifications You must be signed in to change notification settings

Pradyuman7/Algorithmics

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Algorithmics

Algorithmics Contributions welcome License: MIT

A Java library for people who want to implement some algorithms quickly

Table of Contents

How to use

Algorithmics can be added in your project via:

Maven (you can match the version with the version available)

<repositories>
    <repository>
	  <id>jitpack.io</id>
	  <url>https://www.jitpack.io</url>
    </repository>
</repositories>
<dependency>
    <groupId>com.github.Pradyuman7</groupId>
    <artifactId>Algorithmics</artifactId>
    <version>V1.1</version>
</dependency>

Gradle (you can match the version with the version available)

allprojects {
    repositories {
        maven { url 'https://www.jitpack.io' }
    }
}
dependencies {
    implementation 'com.github.Pradyuman7:Algorithmics:V1.1'
}

Algorithmics' Classes

Name Description ReadMe
SievePrimesAlgorithm Find and Generate Prime numbers using Sieve's algorithm. here
NumOccurencesOfCharacters Find number of occurrences of different/particular character(s) in a string. here
Divisors Find number of divisors of the number of your choice. here
CheckPrime Check if a number is prime or not, efficiently. here
GetDivSquareSum Get sum of squares of divisors of a number efficiently. here
BinarySearch Search result for a number in an array of integers. here
MaxSubArraySum Find the maximum continuous sub array sum in a given array. here
FindMaxSubArrayProduct Find the maximum continuous sub array product in a given array of fixed length and no length constraint. here
Exponent Calculate exponents of natural numbers. here
FindPhrase Find number of occurrences of a smaller string in a bigger string. here
Find2DMatrixSum Find sum of 2d matrix with long and int return types. here
CountDistinctElements Returns the number of distinct elements in an integer array here
CountSorting Returns the sorted array after sorting via count sort algorithm here
MatrixMultiplication2D Returns the multiplied matrix (if possible or returns null) here
PerfectPowerAlgorithm Returns the root and the exponent in an array of size 2 for a given natural number n (or null) here

Documentation

Kindly refer the docs.

License

License: MIT

Algorithmics is under MIT License. See License for more info.

Contributing guide

Do you want to contribute to Algorithmics? Awesome, there are not many rules but just a few things to consider before making a PR, simply refer to CONTRIBUTING.md and some guidelines in the available issues.

Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.

If you're new to GitHub and/or contributing to open source projects, please refer this resource.

Checkstyle guide

This repository follows the Google Java Style Guide. Feel free to download formatting presets for your IDE from Google's GitHub repository. We have set up checkstyle to enforce them throughout this project. You can check locally if your changes comply with these guidelines by executing the maven goal compile. If the build of your Pull Request fails make sure to checkout the logs in the checks of your Pull Request to see what exactly does not comply with our guidelines. If you think that you are still complying with the guidelines, feel free to make corresponding changes to our checkstyle file.