NeoAlgo

NeoAlgo copied to clipboard

binary search without using length function (built-in) in java under GSSOC'22

2

## 🚀 Feature This code is to find a particular element in an sorted array when we do not know the length of the array and are not allowed to...

Akshitajain1906

Bug at Binary Search

2

https://github.com/HarshCasper/NeoAlgo/blob/4f1e5bdd6d9d899fa354de94740e0aecf5ecd2be/Go/search/binary_search/binary_search.go#L24 Here is a bug at the above line, which will case an overflow if `low = 10^9` and `high = 1`, because `10^9 + 1` will cause overflow. So...

mohanadtalat91

I would like to add the 3-Partition Problem inside java folder

2

## 🚀 Feature 3-partition problem: Given a set S of positive integers, determine if it can be partitioned into three disjoint subsets that all have the same sum, and they...

ritikverma2000

### Have you read the [Contributing Guidelines on Pull Requests](https://github.com/TesseractCoding/NeoAlgo/blob/master/CONTRIBUTING.md#pull-requests)? (Write your answer here.) ### Description (Write your answer here.) ### Checklist - [x] I've read the contribution guidelines. -...

Priyanshuiiitg

Thank You for Accepting PR. Go Go Hacktoberfest 22'

iamujjwalrawat

### Have you read the [Contributing Guidelines on Pull Requests](https://github.com/TesseractCoding/NeoAlgo/blob/master/CONTRIBUTING.md#pull-requests)? Yes, I have read and followed the mentioned guidelines. ### Description I saw that there was only KMP algorithm mentioned...

prasannakroy

### Have you read the [Contributing Guidelines on Pull Requests](https://github.com/TesseractCoding/NeoAlgo/blob/master/CONTRIBUTING.md#pull-requests)? Yes ### Description - Implement iterative version for tree traversal including inorder, preorder, postorder - Improve printing output for easier...

hieuwu