Sub-second maintenance. 2x read/write performance. Built-in vector search for AI apps.
Cloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
Start Free
Earn up to 16% annual interest with Nexo.
Access competitive interest rates on your digital assets.
Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform.
Geographic restrictions, eligibility, and terms apply.
Google-like local search engine for your personal computer
This is a desktop search tool, similar to a well-known search engine, that you can use on your Debian/Linux-based computer. It allows you to perform local searches by indexing all memory units connected to your computer.
Github: https://github.com/shampuan/Booble
All my projects: https://sourceforge.net/u/shampuan/profile
This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way.
Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for...