Update README.md

README.md

@@ -46,12 +46,15 @@ Under the hoos, the model will see a prompt that's formatted like so:
 <BOS_TOKEN><|START_OF_TURN_TOKEN|><|USER_TOKEN|>{prompt}<|END_OF_TURN_TOKEN|><|START_OF_TURN_TOKEN|><|CHATBOT_TOKEN|>
 ```
 
+Note that this model does not support a System prompt.
+
 ## Use case and examples
 
 Command-R is tuned for a broad range of uses such as reasoning, summarizing, general knowledge, and coding.
 
 ### Reasoning:
 
+```
 <BOS_TOKEN><|START_OF_TURN_TOKEN|><|USER_TOKEN|>
 Statements:
 
@@ -75,51 +78,54 @@ II. No mathematician is irrational: This conclusion is a direct inference from t
 III. Some scientists are irrational: This conclusion does not necessarily follow from the given statements. While it's true that not all scientists may be logical thinkers (as indicated in the second conclusion), it doesn't imply that they are irrational. The statement about scientists being irrational cannot be definitively concluded from the given information, so this conclusion is not correct. 
 
 In summary, only I and II are correct conclusions based on the logical relationships within the statements provided.<|END_OF_TURN_TOKEN|>
+```
 
 ### Coding:
 
+```
 <BOS_TOKEN><|START_OF_TURN_TOKEN|><|USER_TOKEN|>
 Can you provide a merge sort implementation in python?<|END_OF_TURN_TOKEN|>
 <|START_OF_TURN_TOKEN|><|CHATBOT_TOKEN|>
 Here's a merge sort implementation in Python:
-```python
-def merge_sort(arr):
-    if len(arr) > 1:
-        mid = len(arr) // 2
-        left = arr[:mid]
-        right = arr[mid:]
-
-        merge_sort(left)
-        merge_sort(right)
 
-        i = j = k = 0
-
-        while i < len(left) and j < len(right):
-            if left[i] < right[j]:
+    def merge_sort(arr):
+        if len(arr) > 1:
+            mid = len(arr) // 2
+            left = arr[:mid]
+            right = arr[mid:]
+    
+            merge_sort(left)
+            merge_sort(right)
+    
+            i = j = k = 0
+    
+            while i < len(left) and j < len(right):
+                if left[i] < right[j]:
+                    arr[k] = left[i]
+                    i += 1
+                else:
+                    arr[k] = right[j]
+                    j += 1
+                k += 1
+    
+            while i < len(left):
                 arr[k] = left[i]
                 i += 1
-            else:
+                k += 1
+    
+            while j < len(right):
                 arr[k] = right[j]
                 j += 1
-            k += 1
-
-        while i < len(left):
-            arr[k] = left[i]
-            i += 1
-            k += 1
-
-        while j < len(right):
-            arr[k] = right[j]
-            j += 1
-            k += 1
-
-# Example usage
-my_list = [12, 11, 13, 5, 6, 7]
-merge_sort(my_list)
-print(my_list)
-```
+                k += 1
+    
+    # Example usage
+    my_list = [12, 11, 13, 5, 6, 7]
+    merge_sort(my_list)
+    print(my_list)
+
 
 The `merge_sort` function takes a list `arr` as input and recursively divides it into two halves until each half contains a single element or is empty. It then merges the two sorted halves in a sorted manner. The example usage demonstrates how to use the function to sort a list.<|END_OF_TURN_TOKEN|>
+```
 
 ## Technical Details