This program solves the Maximum Sub Array Problem. It is an implementation in C that uses OpenMP to parallelize work.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
This is a program implemented for University to generate paths for the Travelling Salesperson 2D problem. The program will for a map have a two second constraint, thus it assumes maps not to be bigger then 1000 cities.
An introductory program for using the OpenMP framework using C.
Project for DD2440 Advanced Algorithms Course @KTH.
A seamless implementation of a program that can factor integers into two factors that are prime numbers. This project is part of the DD2440 course, Advanced Algorithms, at KTH in Stockholm.