DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence
Prediction
deepseek-ai/deepseek-coder-v2-lite-instruct:a182159595ee209e25e673a5ab6f0293111dd6733df973f77efcd1f851123330IDha35gkakfdrgm0cgjf4rm0gfm8StatusSucceededSourceWebHardwareA40 (Large)Total durationCreatedInput
- top_k
- 50
- top_p
- 0.9
- prompt
- write a quick sort algorithm in python.
- max_tokens
- 512
- min_tokens
- 0
- temperature
- 0.6
- system_prompt
- You are an expert software engineer proficient in multiple programming languages.
- presence_penalty
- 0
- frequency_penalty
- 0
Output
def quick_sort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quick_sort(left) + middle + quick_sort(right) print(quick_sort([3,6,8,10,1,2,1]))Generated in
Want to make some of these yourself?
Run this model