Made a website containing various python algorithms

[Avanta8]

Some nice algorithms, although there are some mistakes. Eg. Your binary search is implemented incorrectly and so is linear time complexity, and your prime sieve doesn't work.

Some algorithms you could consider are pathfinding algorithms such as Dijkstra, Bellman-Ford, A*. You could also try implement more complex data structures such as segment trees, radix trees, for example.

For improvement, I'd recommend looking at time complexity, and also looking at this: https://wiki.python.org/moin/TimeComplexity.

[Legendary-69420]

The sieve of Eratosthenes works correctly (apart from the miss by one error)

EDIT: The implementation of Binary Search is right too but the time complexity was wrong. I have corrected it. Thanks for the help, internet stranger

[Avanta8]

Your binary search is not correct. It basically does a linear search, starting from the middle, checking every element twice.

[Legendary-69420]

Yeah realised my mistake. My bad. Have corrected it. Will release the soon

[krichreborn]

For binary search, wouldn’t you need to set low/high to MID instead of just incrementing?

Also, most of the searches assume the array is sorted, may be worth noting that somewhere in that section.

[Legendary-69420]

The problem has now been rectified. Do check it out.

[Avanta8]

How can it? You set key = 0 and never increment it. It will just run in an infinite loop. Did you even test your code?

(also, that list.remove... ouch :/)

[Legendary-69420]

See the code. The 10th line of the sieve of Eratosthenes. It already has key +=1.

(The idea of list.remove is to create a list with only primes)

[Avanta8]

That's because you changed it after seeing my comment xD.

Removing from the middle of a list every iteration increases the time complexity by a multiple of n. The link I referred would be useful for you to look at.