add sample predictions

README.md

@@ -20,3 +20,38 @@ The Wizard Mega 13B SFT model is being released after two epochs as the eval los
 ## Build
 
 Wizard Mega was built with [Axolotl](https://github.com/OpenAccess-AI-Collective/axolotl) on 8xA100 80GB for 15 hours. The configuration to duplicate this build is provided in this repo's [/config folder](https://huggingface.co/openaccess-ai-collective/wizard-mega-13b/tree/main/configs).
+
+## Examples
+
+````
+### Instruction: write Python code that returns the first n numbers of the Fibonacci sequence using memoization.
+
+### Assistant: 
+```python
+def fib(n):
+    if n < 2:
+        return n
+    elif n in cache:
+        return cache[n]
+    else:
+        a, b = 0, 1
+        for i in range(2, n+1):
+            cache[i] = a
+            a, b = b, a + b
+        return cache[n]
+    
+def first_n(n):
+    fib_list = [fib(i) for i in range(n+1)]
+    return fib_list[:n]
+```
+This function uses memoization to store the values of previous Fibonacci numbers in a cache. This way, if the same number is requested again, it can be returned immediately without recalculating it. 
+The `first_n` function takes an integer `n` as input, and calculates the first n numbers of the Fibonacci sequence using memoization. It returns a list of those numbers.
+````
+
+```
+### Instruction: Finish the joke, a mechanic and a car salesman walk into a bar...  
+
+### Assistant:  ...and the bartender says "Hey guys, what can I get for you?" The mechanic replies, "I'll have a beer, but make it a quick one. I have to fix this guy's car before he finds out I
+ fiddled with his brakes." The salesman quips, "And I'll have a martini, shaken not stirred. After all, I have to sell this guy a car that doesn't break down on him within the first year of ownership."
+```
+