From 2f6b87d20d4ff3d34695389844d8605162fbe103 Mon Sep 17 00:00:00 2001 From: Jonathan Turner Date: Thu, 15 Feb 2024 13:54:25 -0500 Subject: [PATCH] Added Big O Efficiency Table. --- src/Assignments/A2/Substrings.java | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/src/Assignments/A2/Substrings.java b/src/Assignments/A2/Substrings.java index 7e52255..de26dc3 100644 --- a/src/Assignments/A2/Substrings.java +++ b/src/Assignments/A2/Substrings.java @@ -33,6 +33,26 @@ Algorithm Design Block return counter, comps Big-O Analysis: (Based on Implementation) + | if(B) | incr substring | + init Comps | init values | i | if(a) | j | min max | min max | + ------------------------------------------------------------------------------ + 1 | 1 | 1 | 1 | n-2 | 0 n-2 | 0 n-2 | + | | 2 | 1 | n-3 | 0 n-3 | 0 n-3 | + | | 3 | 1 | n-4 | 0 n-4 | 0 n-4 | + | | 4 | 1 | n-5 | 0 n-5 | 0 n-5 | + | | 5 | 1 | n-6 | 0 n-6 | 0 n-6 | + | | . | . | ... | . ... | . ... | + | | n | 1 | 0 | 0 0 | 0 0 | + ------------------------------------------------------------------------------ + 1 | 1 | X | n | X | 0 n^(2)-n| 0 n^(2)-n| + ------- ------- + 2 2 + + Best-Case Scenario: n + 0 + 0 = n + Worse-Case Scenario: n + (n^(2)-n)/2 + (n^(2)-n)/2 = n + n^(2)-n = n^(2) + Average-Case: (n^(2)+n)/2 + + Big O => O(n^2) */ package Assignments.A2;