Palindrome Partitioning

language: C (not C++)

using recursion

we have a string, and we have to find all possible palindromic partitions. For example- If we had "success" as the input string, all possible partitions would be-

{s} {u} {c} {c} {e} {s} {s} {s} {u} {c} {c} {e} {ss} {s} {u} {cc} {e} {s} {s} {s} {u} {cc} {e} {ss}

Input success Output successsuccesssuccesssuccess