Commit
·
2bb874a
1
Parent(s):
a6c9537
Update README.md
Browse files
README.md
CHANGED
|
@@ -76,8 +76,11 @@ output = text_gen(f"<s>[INST]{query}[/INST]")
|
|
| 76 |
print(output[0]['generated_text'])
|
| 77 |
"""
|
| 78 |
<s>[INST]Write a quick sort algorithm in Python[/INST]
|
|
|
|
| 79 |
Quick sort is a divide and conquer algorithm that sorts an array in-place.
|
| 80 |
-
It works by repeatedly dividing the array into two sub-arrays, sorting
|
|
|
|
|
|
|
| 81 |
Here's a Python implementation of the quick sort algorithm:
|
| 82 |
|
| 83 |
```python
|
|
|
|
| 76 |
print(output[0]['generated_text'])
|
| 77 |
"""
|
| 78 |
<s>[INST]Write a quick sort algorithm in Python[/INST]
|
| 79 |
+
|
| 80 |
Quick sort is a divide and conquer algorithm that sorts an array in-place.
|
| 81 |
+
It works by repeatedly dividing the array into two sub-arrays, sorting
|
| 82 |
+
them, and then merging them back together.
|
| 83 |
+
|
| 84 |
Here's a Python implementation of the quick sort algorithm:
|
| 85 |
|
| 86 |
```python
|