Search Results for "pl/i"

...This software was created to help people understand how is the CRC calculated and be able to see it in a practical way, it is also available to copy and use it for your own project. I hope it helps you. ES: Código creado para mostrar como se realiza el cálculo de un CRC. Con el mismo se incluyen varios CRCs que pueden ser escogidos. Este software se creó con el propósito de ayudar a la gente a entender como se hace el cálculo de un CRC de una manera más práctica y sencilla, también se puede copiar y aprovecharlo para otras aplicaciones. ...

This project contains solutions for all training lessons that can be found on website codility.com: https://codility.com/programmers/lessons/ The solutions are written in programming language C, because I presumed that it is the most basic language anyone can easily understand and the fact that many other languages have a basis in C means the code can be easily rewritten in that language.

I is a cross-platform programming language designed towards efficiency during development and at runtime.

The Jsolution package is a collection of programs, scripts,libraries and documents that i have written and use in my daily life.

...It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of the new tree sub-category, there can be others. In any case, read the PDF: “Capsule Trees - A Primer”, before delving into the code.

This is example code that I reference in my blogs on software development.

The project will be looking at data (the intention is to begin looking at customer name/address data but this may widen over time) and ways to intelligently detect duplicates using fuzzy matching methods and algorithms.

A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.

...Whoever is responsible for this sorry situation ought to be ashamed. So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In addition, I will provide a textual description of the algorithm so that it can be easily ported to any programming language. I expect a severe performance degradation, but I leave optimizing for speed to other people.