Software Engineering KB

Home

❯

01 Foundations

❯

03 Mathematics for CS

❯

02 Sub Concept

❯

Permutations

Permutations

Feb 10, 20261 min read

  • mathematics-for-cs
  • discrete-mathematics
  • combinatorics
  • permutations

Permutations

← Back to Combinatorics

Ordered arrangements of elements. The number of permutations of n elements is n!. Permutations of k elements from n is P(n,k) = n!/(n-k)!. Used in analyzing algorithm complexity, cryptographic key spaces, and counting problems.

mathematics-for-cs discrete-mathematics combinatorics permutations


Graph View

Backlinks

  • Combinatorics

Created with Quartz v4.5.2 © 2026

  • GitHub