Thumbnail
Access Restriction
Open

Author Cha, Sung-Hyuk
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Recursive Algorithm ♦ Positive Integer ♦ Positive Number
Abstract Abstract. This article first reviews the problem of partitioning a positive integer in general. And then recursive algorithms for P(n,k), generating exactly k partitions of a positive number n are presented. The most efficient recursive algorithm’s computational running time is Θ(k×p(n,k)) which is the lower bound of P(n,k) problem. 1
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article