Ricco/test pr 01

local-test.py

@@ -0,0 +1,24 @@
+def merge_sort(arr):
+    """
+    Merge sorts an array of integers.
+
+    Parameters:
+    - arr (list): The array to be sorted.
+
+    Returns:
+    - sorted_arr (list): The sorted array.
+    """
+    if len(arr) <= 1:
+        return arr
+
+    # Split the array into two halves
+    mid = len(arr) // 2
+    left = arr[:mid]
+    right = arr[mid:]
+
+    # Recursively sort the left and right halves
+    left_sorted = merge_sort(left)
+    right_sorted = merge_sort(right)
+
+    # Merge the sorted halves into a single sorted array
+    merged = merge(left_sorted, right_sorted)

my-vulnerable-code.php

@@ -0,0 +1,31 @@
+<?php
+// Get the user input from a GET request
+$user_id = $_GET['user_id'];
+
+// Create a connection to the database
+$conn = new mysqli("localhost", "username", "password", "database");
+
+// Check connection
+if ($conn->connect_error) {
+    die("Connection failed: " . $conn->connect_error);
+}
+
+// Construct the SQL query
+$sql = "SELECT * FROM users WHERE id = $user_id";
+
+// Execute the query
+$result = $conn->query($sql);
+
+// Check if the query was successful
+if ($result->num_rows > 0) {
+    // Output data of each row
+    while($row = $result->fetch_assoc()) {
+        echo "id: " . $row["id"]. " - Name: " . $row["name"]. "<br>";
+    }
+} else {
+    echo "0 results";
+}
+
+// Close the connection
+$conn->close();
+?>

script/copilot_written.py

@@ -0,0 +1,29 @@
+def max_product_subarray(nums):
+    if not nums:
+        return []
+
+    max_product = nums[0]
+    min_product = nums[0]
+    result = nums[0]
+    start = end = s = 0
+
+    for i in range(1, len(nums)):
+        if nums[i] < 0:
+            max_product, min_product = min_product, max_product
+
+        max_product = max(nums[i], max_product * nums[i])
+        min_product = min(nums[i], min_product * nums[i])
+
+        if max_product > result:
+            result = max_product
+            start = s
+            end = i
+
+        if max_product == nums[i]:
+            s = i
+
+    return nums[start:end + 1]
+
+# Example usage:
+nums = [2, 3, -2, 4]
+print(max_product_subarray(nums))  # Output: [2, 3]

script/my_code.py

@@ -0,0 +1,31 @@
+class Solution:
+    def check_prime(self, x: int) -> bool:
+        for i in range(2, int(x**0.5) + 1):
+            if x % i == 0:
+                return False
+        return True
+
+    def primeSubOperation(self, nums: List[int]) -> bool:
+        for i in range(len(nums)):
+            # In case of first index, we need to find the largest prime less than nums[0].
+            if i == 0:
+                bound = nums[0]
+            else:
+                # Otherwise, we need to find the largest prime, that makes the current element
+                # closest to the previous element.
+                bound = nums[i] - nums[i - 1]
+
+            # If the bound is less than or equal to 0, then the array cannot be made strictly increasing.
+            if bound <= 0:
+                return False
+
+            # Find the largest prime less than bound.
+            largest_prime = 0
+            for j in range(bound - 1, 1, -1):
+                if self.check_prime(j):
+                    largest_prime = j
+                    break
+
+            # Subtract this value from nums[i].
+            nums[i] = nums[i] - largest_prime
+        return True

script/not_user_writt.py

@@ -0,0 +1,16 @@
+def max_product_subarray(nums):
+    if not nums:
+        return 0
+
+    max_product = min_product = result = nums[0]
+
+    for num in nums[1:]:
+        if num < 0:
+            max_product, min_product = min_product, max_product
+
+        max_product = max(num, max_product * num)
+        min_product = min(num, min_product * num)
+
+        result = max(result, max_product)
+
+    return result

script/python-sc.py

@@ -0,0 +1,31 @@
+class Solution:
+    def check_prime(self, x: int) -> bool:
+        for i in range(2, int(x**0.5) + 1):
+            if x % i == 0:
+                return False
+        return True
+
+    def primeSubOperation(self, nums: List[int]) -> bool:
+        for i in range(len(nums)):
+            # In case of first index, we need to find the largest prime less than nums[0].
+            if i == 0:
+                bound = nums[0]
+            else:
+                # Otherwise, we need to find the largest prime, that makes the current element
+                # closest to the previous element.
+                bound = nums[i] - nums[i - 1]
+
+            # If the bound is less than or equal to 0, then the array cannot be made strictly increasing.
+            if bound <= 0:
+                return False
+
+            # Find the largest prime less than bound.
+            largest_prime = 0
+            for j in range(bound - 1, 1, -1):
+                if self.check_prime(j):
+                    largest_prime = j
+                    break
+
+            # Subtract this value from nums[i].
+            nums[i] = nums[i] - largest_prime
+        return True