Skip to content

Add LLM prompt: Explain Merge Sort with code and complexity #98

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
asmxtaa wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Add LLM prompt: Explain Merge Sort with code and complexity #98

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 28 additions & 0 deletions llm/sorting-algorithm-explainer.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
# Explain a Sorting Algorithm with Code (LLM Prompt)

## Objective:
Use a Large Language Model (LLM) like ChatGPT or DeepSeek to explain a sorting algorithm step-by-step, with a code example in Python.

---

## Prompt:
> “Explain how the Merge Sort algorithm works, step-by-step. Include a Python code implementation. Then describe the time and space complexity in simple terms. Finally, provide one use case where Merge Sort is better than Quick Sort.”

---

## Expected LLM Response Structure:
1. **Algorithm Explanation** – What it does and how it works
2. **Code Implementation** – Merge Sort in Python (with comments)
3. **Complexity Analysis** – Time and Space complexity
4. **Use Case Example** – When and why to prefer Merge Sort

---

## Test Scenario:
Try this prompt on ChatGPT-4, DeepSeek, or Ollama with LLaMA3 and verify if the response includes all expected parts.

---

## Use Case:
This LLM prompt helps software engineers or students quickly understand and visualize a commonly asked algorithmic topic like Merge Sort, backed by both theory and implementation.