Search Results for "penetration testing os"

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...

Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim.

XSWAG (Extended SourceWare Archive Group) is a revival project for the famous SWAG code archives for the Pascal programming language. This project is open to every Pascal/Delphi programmer who wishes to contribute to the global Pascal knowledge base. Current version (testing 0.9) features : - a reader program : allows users to browse through the code archives, organizes them by type and operating system and updates the archives from multiple XSWAG servers. - a server daemon : maintains a list of archives and provides updates to clients. - a creator program : to quickly make or modify an XSWAG archive file, add/remove sources and update sources info (os, compiler, architecture, contact info, author name, subject).

Java implementation of the most commonly used algorithms for exact string matching, where the pattern is given first.