Refine by Time Frame

updated 3 months ago

Jos (10584) (view profile)

Permutations with repetition, all or a subset

permn(V, N, K)

updated 3 months ago

Jos (10584) (view profile)

Subset of all permutations with repetition

permnsub(V,N, IX)

updated 1 year ago

Jos (10584) (view profile)

All combinations of input (v4.0, feb 2014)

allcomb(varargin)

updated 1 year ago

Hin Kwan Wong (view profile)

Finds all partitions of a set containing homogenous elements, also called integer partitions.

intpartitions(varargin)

updated 2 years ago

Jos (10584) (view profile)

returns those subsets (= combinations of elements of a set) that fulfill a specific criterion

nchoosecrit(S, FUN)

updated 3 years ago

Matt Fig (view profile)

All possible permutations of the elements of set N, taken K at a time, with repetition.

npermutek(N,K)

updated 3 years ago

Jbittner (view profile)

A simple approach to solving a scrabble board via logical brute force scoring.

findmyword(myhunt, mylet, mywor, myAl...

inordercombo( ain )

isltrd

updated 3 years ago

Jos (10584) (view profile)

K-th combination(s) of elements

kthcombn

updated 3 years ago

Bruce Raine (view profile)

This function can return N choose K (K <= N) as well as a BC matrix up to N choose N.

binomind(n,k,speed)

updated almost 4 years ago

Jonas Lundgren (view profile)

Choose K indices from the set 1:N.

ichoose(n,k)

updated almost 5 years ago

Mukhtar Ullah (view profile)

Binomial coefficient of arrays

binomial(n, k)

updated almost 5 years ago

Matt Fig (view profile)

Returns 1 of 4 different samplings on the set 1:N, taken K at a time.

combinator(N,K,s1,s2)

cumsumall.m

updated 5 years ago

Jos (10584) (view profile)

return all combinations of the elements of a set

nchoose(S)

updated 5 years ago

Jan Simon (view profile)

Choose K elements from a vector without repetitions and with order [MEX]

TestVChooseKO(doSpeed)

VChooseKO.m

updated 5 years ago

Jan Simon (view profile)

Choose K elements from a vector with repetitions and without order [MEX]

TestVChooseKR(doSpeed)

VChooseKR.m

updated 5 years ago

Jan Simon (view profile)

Choose K elements from a vector with repetitions and order [MEX]

TestVChooseKRO(doSpeed)

VChooseKRO.m

updated 5 years ago

Jan Simon (view profile)

Choose K elements from a vector - MEX: 100 times faster than NCHOOSEK

TestVChooseK(doSpeed)

VChooseK(X, K)

updated 6 years ago

Ben Petschel (view profile)

files for iterating over permutations, combinations, subsets and vectorized for/while loops

nextchoose(v,w)

nextfor(v,lo,hi,dx)

nextperm(v)

updated 6 years ago

Matt Fig (view profile)

Produces one comb/perm at a time. Both with/without repetition.

nextchoose(N,K)

nextmultichoose(N,K)

nextperm(N,K)

updated 6 years ago

Matt Fig (view profile)

Finds all partitions of a set, or only those partitions of a specified length. Includes a viewer.

partdisp(C,K)

partitions(M,K)

updated 6 years ago

Gautam Vallabha (view profile)

Returns combinations of a set of numeric or cell vectors (uses a memory-efficient algorithm)

combinations(varargin)

updated almost 7 years ago

Dan Stowell (view profile)

Given a set of N items, iterate over all the combinations of size R (R<N)

nextcombi.m

updated 7 years ago

Jos (10584) (view profile)

all combinations of two elements

nchoose2(X)

updated 7 years ago

Simone Scaringi (view profile)

All combinations of N elements taken two at the time.

nCtwo(dat)

updated almost 9 years ago

Christopher Poletto (view profile)

Creates spreadsheet of all possible Kakuro solutions.

combos(maxdigit)

findsum(total,digit)

updated almost 10 years ago

Peter (PB) Bodin (view profile)

Fast unordered samples with or without repetition.

nmultichoosek(n,k,type)

updated 11 years ago

Ted Imboden (view profile)

Displays graphs of three to eight vertices

updated almost 14 years ago

Juan L. J. Bascones (view profile)

This function evaluates all possible combinations of N elements taken by sets of S.

MakeComb(n,s)