<jupyter_start><jupyter_text><jupyter_code><jupyter_output><empty_output><jupyter_text>RECURSIVIDAD<jupyter_code>def fnRecInfinita():
  print('Hola')
  fnRecInfinita()
fnRecInfinita()
def fnRec(x):
  if x == 0:
    print('Stop')
  else:
    fnRec(x-1)
    print(x)

def main():
  print("Program starts")
  fnRec(5)
  print('Program ends')

main()
def printRev(x):
  if x > 0:
    print(x)
    printRev(x-1)
    print('End of stack in', x)

printRev(3)
def fibonacci(x):
  if x == 1 or x == 0:
    return x
  else:
    return ( fibonacci(x-1) + fibonacci(x-2) )
  
fibonacci(8)<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.16006600660066006, 'fraction_numerical': 0.018151815181518153, 'mean_word_length': 4.100840336134453, 'pattern_counts': {'":': 0, '<': 9, '<?xml version=': 0, '>': 10, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '2', 'dir': 'jupyter-structured-clean-dedup', 'id': '238072', 'license': 'MIT', 'n_tokens_mistral': 274, 'n_tokens_neox': 268, 'n_words': 50, 'path': '02diciembre2020.ipynb', 'repo_name': 'brus2099/daa_2021_1', 'size': '606'}