From 9adbd2eea56e12b70116a71fb610ab517531b6fd Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Edward=20Mart=C3=ADnez?= Date: Sun, 12 Jul 2020 21:27:20 -0500 Subject: [PATCH] Solucion Reto Computer Science 01 --- 1.md | 4 ++-- 2.md | 6 ++++-- 3.md | 4 ++-- 4.md | 4 ++-- 5.md | 4 ++-- 6.md | 4 ++-- 6 files changed, 14 insertions(+), 12 deletions(-) diff --git a/1.md b/1.md index b0dd3c5..f4062d1 100644 --- a/1.md +++ b/1.md @@ -14,8 +14,8 @@ for j := 0; j < M; j++ { ## Time Complexity -YOUR ANSWER GOES HERE +T(N) = O(N+M) ## Space complexity -YOUR ANSWER GOES HERE +O(1) diff --git a/2.md b/2.md index 2e803bf..c91eb09 100644 --- a/2.md +++ b/2.md @@ -16,8 +16,10 @@ for k := 0; k < N; k++ { ## Time Complexity -YOUR ANSWER GOES HERE +T(N) = O(N*N)+ O(N) +T(N) = O(N^2)+ O(N) +T(N) = O(N^2) ## Space complexity -YOUR ANSWER GOES HERE +O(1) diff --git a/3.md b/3.md index 35b790d..e62bb2e 100644 --- a/3.md +++ b/3.md @@ -11,8 +11,8 @@ while (N > 0) { ## Time Complexity -YOUR ANSWER GOES HERE +T(N) = O(N) ## Space complexity -YOUR ANSWER GOES HERE +O(1) diff --git a/4.md b/4.md index 287d05d..ca708cb 100644 --- a/4.md +++ b/4.md @@ -15,8 +15,8 @@ func count(L []int, v, start, end int) int { ## Time Complexity -YOUR ANSWER GOES HERE +T(N) = 2^N ## Space complexity -YOUR ANSWER GOES HERE +O(N) diff --git a/5.md b/5.md index d2c9800..791b0b9 100644 --- a/5.md +++ b/5.md @@ -12,8 +12,8 @@ for(let i = n/2; i <= n; i++) { ## Time Complexity -YOUR ANSWER GOES HERE +T(N) = O(N LOG N) ## Space complexity -YOUR ANSWER GOES HERE +O(1) diff --git a/6.md b/6.md index 15a33c7..d05a5c8 100644 --- a/6.md +++ b/6.md @@ -12,8 +12,8 @@ for (int i = n; i > 1; i /= 2) { ## Time Complexity -YOUR ANSWER GOES HERE +T(N) = O(N LOG N) ## Space complexity -YOUR ANSWER GOES HERE +O(1)