Base 13 Conversion — Capital One Python Interview Question (Step-by-Step) 8:11 | A processar vídeo... A Carregar... Transferir
![L-2.9: Recurrence Relation [T(n)= 2T(n/2) +cn] | Recursive Tree method | Algorithm](https://i.ytimg.com/vi/bJg_sv7PV-g/hqdefault.jpg)