Update merge_server.py

merge_server.py

@@ -261,6 +261,15 @@ def predict():
                 "improvements": ["Ensure your loop stops at the square root of n.", "Handle edge cases for 1, 2, and 3 explicitly."],
                 "optimized_code": "import math\ndef [FUNC_NAME]([ARGS]):\n    if [FIRST_ARG] <= 1: return False\n    if [FIRST_ARG] in (2, 3): return True\n    if [FIRST_ARG] % 2 == 0 or [FIRST_ARG] % 3 == 0: return False\n    for i in range(5, int(math.sqrt([FIRST_ARG])) + 1, 6):\n        if [FIRST_ARG] % i == 0 or [FIRST_ARG] % (i + 2) == 0: return False\n    return True"
             },
+            "Constant-Time": {
+                "space": "O(1)",
+                "explanation": "✅ EFFICIENT: No custom loops or recursive calls were detected. The algorithm executes sequentially, indicating O(1) constant structural time.",
+                "improvements": [
+                    "Structurally, this code is highly efficient.",
+                    "⚠️ NOTE: Built-in Python functions like `sum()`, `max()`, `zip()`, or list slicing secretly run in O(n) linear time in C under the hood, even without explicit `for` loops!"
+                ],
+                "optimized_code": "# 💡 ALGORITHM TIP:\n# Your code executes sequentially without custom loops.\n# If you are processing massive datasets, ensure you aren't relying \n# too heavily on hidden O(n) operations (like 'in' on a list)."
+            },
             "GCD (Euclidean)": {
                 "space": "O(1)",
                 "explanation": "✅ PERFECT: Euclidean algorithm is the most efficient way to find GCD.",