From bbacf372fe1619801196b25b3027d0a8857fb3fe Mon Sep 17 00:00:00 2001 From: Vitor Buxbaum Orlandi Date: Thu, 16 Sep 2021 18:07:03 -0300 Subject: [PATCH] =?UTF-8?q?Torna=20m=C3=A9todos=20protegidos?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- 2_paradigmas/07_max_min_recursivo.py | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/2_paradigmas/07_max_min_recursivo.py b/2_paradigmas/07_max_min_recursivo.py index 311113a..1b1f659 100644 --- a/2_paradigmas/07_max_min_recursivo.py +++ b/2_paradigmas/07_max_min_recursivo.py @@ -25,16 +25,16 @@ def max_min(cls, numeros): metade = len(numeros) // 2 check_head = cls.max_min(numeros[:metade]) check_tail = cls.max_min(numeros[metade:]) - resultado_max_min["max"] = cls.decide_max(check_head, check_tail) - resultado_max_min["min"] = cls.decide_min(check_head, check_tail) + resultado_max_min["max"] = cls._decide_max(check_head, check_tail) + resultado_max_min["min"] = cls._decide_min(check_head, check_tail) return resultado_max_min @classmethod - def decide_max(cls, head, tail): + def _decide_max(cls, head, tail): return head["max"] if head["max"] > tail["max"] else tail["max"] @classmethod - def decide_min(cls, head, tail): + def _decide_min(cls, head, tail): return head["min"] if head["min"] < tail["min"] else tail["min"]