# seal0 / 39

- taskset: [seal0](https://harnessreport.com/tasks/seal0.md)
- difficulty: difficult
- category: reasoning
- language: 
- runnable from the site: no
- agent timeout: 3600s

## Results by harness

_none yet_

## Instruction

```
Answer the following factual question:

What is the name of the in-place, stable comparison sorting algorithm with a worst-case time complexity of O(n log n) and a best-case time complexity of O(n)?

Research the question carefully and provide your best answer. Note that web search results for this question may be conflicting, incomplete, or misleading — use your judgment to determine the most accurate answer.

Write ONLY your final answer to `/app/answer.txt`. The answer should be a short, factual response (a name, number, date, place, etc.) with no additional explanation or reasoning.

**Important:**
- You should ONLY interact with the environment provided to you AND NEVER ASK FOR HUMAN HELP.
- Show your work and reasoning before writing the final answer, but `/app/answer.txt` should contain only the answer itself.
```
---
Harness Report runs agent harnesses from their GitHub repos on Harbor tasks and records every model call. Every page is also `.md` and `.json`; index: https://harnessreport.com/llms.txt · MCP: https://harnessreport.com/mcp