Added new GPTs for Black Friday

gpts/pseudocode-conversion.md

@@ -0,0 +1,316 @@
+
+[![Pseudocode Conversion](https://flow-prompt-covers.s3.us-west-1.amazonaws.com/icon/realistic/real_1.png)]()
+# Pseudocode Conversion 
+Pseudocode to Actual Code Conversion
+
+# Prompt
+
+```
+Here’s a pseudocode for finding the largest number in a list. Can you help me convert this into Python, C#, and C++ code?    Initialize max_number to the first item in the list
+   For each number in the list:
+       If number is greater than max_number:
+           Set max_number to number
+   Return max_number
+```
+
+## Conversation
+
+**ASSISTANT**: Sure! Here's how you can convert the pseudocode into actual code in Python, C#, and C++:
+
+
+
+Python:
+
+```
+
+def find_largest_number(lst):
+
+    max_number = lst[0]
+
+    for number in lst:
+
+        if number > max_number:
+
+            max_number = number
+
+    return max_number
+
+```
+
+
+
+C#:
+
+```
+
+public int FindLargestNumber(int[] arr)
+
+{
+
+    int maxNumber = arr[0];
+
+    foreach (int number in arr)
+
+    {
+
+        if (number > maxNumber)
+
+        {
+
+            maxNumber = number;
+
+        }
+
+    }
+
+    return maxNumber;
+
+}
+
+```
+
+
+
+C++:
+
+```
+
+int findLargestNumber(int arr[], int n)
+
+{
+
+    int maxNumber = arr[0];
+
+    for (int i = 1; i < n; i++)
+
+    {
+
+        if (arr[i] > maxNumber)
+
+        {
+
+            maxNumber = arr[i];
+
+        }
+
+    }
+
+    return maxNumber;
+
+}
+
+```
+
+Note that in C++, we need to pass the size of the array as a separate parameter.
+**USER**: Here’s a pseudocode for finding the largest number in a list. Can you help me convert this into Python, C#, and C++ code?
+
+All text between two asterisks is an example:
+
+*** Initialize max_number to the first item in the list
+
+For each number in the list:
+
+If number is greater than max_number:
+
+Set max_number to number
+
+Return max_number***
+**ASSISTANT**: Sure, here's how you can convert the pseudocode into actual code in Python, C#, and C++:
+
+
+
+Python:
+
+```
+
+def find_largest_number(lst):
+
+    max_number = lst[0]
+
+    for number in lst:
+
+        if number > max_number:
+
+            max_number = number
+
+    return max_number
+
+```
+
+
+
+C#:
+
+```
+
+public int FindLargestNumber(int[] arr)
+
+{
+
+    int maxNumber = arr[0];
+
+    foreach (int number in arr)
+
+    {
+
+        if (number > maxNumber)
+
+        {
+
+            maxNumber = number;
+
+        }
+
+    }
+
+    return maxNumber;
+
+}
+
+```
+
+
+
+C++:
+
+```
+
+int findLargestNumber(int arr[], int n)
+
+{
+
+    int maxNumber = arr[0];
+
+    for (int i = 1; i < n; i++)
+
+    {
+
+        if (arr[i] > maxNumber)
+
+        {
+
+            maxNumber = arr[i];
+
+        }
+
+    }
+
+    return maxNumber;
+
+}
+
+```
+
+Note that in C++, we need to pass the size of the array as a separate parameter.
+**USER**: ***   Initialize sum to 0
+
+   Initialize counter to 0
+
+   Initialize current_even to 0
+
+   While counter is less than n:
+
+       Add current_even to sum
+
+       Increment counter
+
+       Increment current_even by 2
+
+   Return sum***
+**ASSISTANT**: Sure, here's how you can convert the pseudocode into actual code in Python, C#, and C++:
+
+
+
+Python:
+
+```
+
+def sum_of_first_n_even_numbers(n):
+
+    sum = 0
+
+    counter = 0
+
+    current_even = 0
+
+    while counter < n:
+
+        sum += current_even
+
+        counter += 1
+
+        current_even += 2
+
+    return sum
+
+```
+
+
+
+C#:
+
+```
+
+public int SumOfFirstNEvenNumbers(int n)
+
+{
+
+    int sum = 0;
+
+    int counter = 0;
+
+    int currentEven = 0;
+
+    while (counter < n)
+
+    {
+
+        sum += currentEven;
+
+        counter++;
+
+        currentEven += 2;
+
+    }
+
+    return sum;
+
+}
+
+```
+
+
+
+C++:
+
+```
+
+int sumOfFirstNEvenNumbers(int n)
+
+{
+
+    int sum = 0;
+
+    int counter = 0;
+
+    int currentEven = 0;
+
+    while (counter < n)
+
+    {
+
+        sum += currentEven;
+
+        counter++;
+
+        currentEven += 2;
+
+    }
+
+    return sum;
+
+}
+
+```
+
+