# Tag Info

### Runtime complexity of permutation function

Consider this piece of code: for i in range(len(nums)): dfs(nums[:i]+nums[i+1:], curr+[nums[i]], res) Note that ...
• 791
1 vote

### How are regular languages not structurally recursive?

Regular languages don't have recursive structures, so formally regular expressions cannot express recursive structures by definition.All regular languages can be recognized by a finite automaton. A ...
• 468
1 vote

• 3,911
1 vote