bubble sort is faster than selection one isn't it? I have writen two codes and I was surprised that bubble is faster than selection :(
easy way, with run time summary of all algorithm, check it once, https://code.sololearn.com/cY7SC8lmidwy/?ref=app
it shows that bubble is faster than selection
I think I have discovered the problem I am using filter to delete vector minimum element this may be make the code slow
Maybe non optimized algorithm Check my research 🤓😉 and thumb-up in codebit if likes. This also encourage myself to continue with next sorting algorithms https://code.sololearn.com/ciT6SI8eE9Q4/?ref=app
Python — File Handling
Help me solve this (using loop)
What is wrong? Error on test.
Help me wiht python
Question is write a c program to print prime numbers up to n and print the largest number in array.