Finite group study, abelians or not, quotient group, direct product and many more...
-
Updated
Mar 26, 2022 - C#
Finite group study, abelians or not, quotient group, direct product and many more...
A library of various math functions created as a DLL
C# implementation of Heaps algorithm to help get all the posible permutation of an array of objects
The Fisher–Yates shuffle is an algorithm for generating a random permutation of a finite sequence—in plain terms, the algorithm shuffles the sequence. The algorithm effectively puts all the elements into a hat; it continually determines the next element by randomly drawing an element from the hat until no elements remain. The algorithm produces …
Memory efficient psuedo-randomly permuted enumerator for C#/.NET to enumerate gigantic ranges.
A C# Console Application used for parsing various date format inputs
A coding challenge to list all the possible ways a student can complete their courses given a set of pre-requisites.
Packet of functions containing several mathematical algorithms.
A practice code written in C# that finds password of hangul document file
Given list of int determines number of possible permutations
Add a description, image, and links to the permutation topic page so that developers can more easily learn about it.
To associate your repository with the permutation topic, visit your repo's landing page and select "manage topics."