Search
New Code
Rapid PHP 2018 15.5
IBDAC 6.4
Online Course Booking Script 1.3.3
Database Workbench Pro 5.6.4
Job Portal Script 1.3.2
The C# PDF Library 5.2
PostgreSQL Data Access Components 6.0
Virtual Data Access Components 11.0
HTMLPad 2018 15.5
WeBuilder 2018 15.5
SentiMask SDK Trial 2.0.0
Track Order For Magento 2 1.0.0
Calendar 365 For Dynamics CRM 4.0
Scimbo 1.2
Odoo Furnito Theme 1.0
Top Code
VisualNEO Web 2018.12.15
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
Code Listing by Jonas Lundgren

Code 1-10 of 10   






Nothing fancy here. Just the recurrence relations and double loops.
It seems to be the most efficient solution for this problem.



Computes the volume/area of the basic alpha shape for a 3D/2D
point set. The code uses delaunayn for Delaunay triangulation.
Can also produce a simple plot.



PI2STR calculates pi decimals with Machin's formula.

S = PI2STR(M) gives pi truncated to M decimals for M < 2^(53/2).
Machin's formula, pi/4 = 4*acot(5) - acot(239), and a number system with base 10^14 is used.

The...



ICHOOSE(N,K) gives all combinations of choosing K indices
from the set 1:N without order and without repetitions.

EXAMPLE:
ind = ichoose(4,2);
v = 'ABCD';
v(ind) % ['AB';'AC';'AD';'BC';'BD';'CD']

ICHOOSE...



Heuristic method for the Traveling Salesman Problem (TSP)
A number of nearest neighbour tours are generated from randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is...



Dragon Curve
Gosper Flowsnake Curve
Hexagon Molecule Curve
Hilbert Curve
Koch Snowflake Curve
Sierpinski Arrowhead Curve
Sierpinski Cross Curve
Sierpinski Triangle Curve



Pretty fast code for zeros of Bessel functions of 1st and 2nd kind
and for zeros of the derivatives. The Newton-Raphson method is used
with the initial guess predicted from previously computed zeros.



Estimates the sum of an alternating series. Three linear methods for convergence acceleration are implemented.

EXAMPLES:

% log(2) = 1 - 1/2 + 1/3 - 1/4 + ...
altsum(1./(1:20))
ans =
0.693147180559945



[FMAX,X] = KP01(W,P,C) solves the combinatorial optimization problem

maximize F = SUM(P.*X),
subject to SUM(W.*X) <= C,

where the solution X is a binary vector of 0s and 1s. W and P are vectors
of weights and...



Evaluation of double integrals by iterated integration. This is a
simple extension of DBLQUAD to non-rectangular regions of the types

D1 = {(x,y): a < x < b, c(x) < y < d(x)},

D2 = {(x,y): a(y) < x <...