Insert a value while preserving sorted order.
Python: Use insort on an already sorted list; insertion still shifts later list elements.
from bisect import insort
values = [1, 3, 5]
insort(values, 4)
print(values)Expected output EXAMPLE
[1, 3, 4, 5]
Details
Save as snippet.py and run python3 snippet.py. Uses the Python standard library. Use insort on an already sorted list; insertion still shifts later list elements.
Tested on Ubuntu 24.04.5 LTS · · Python 3.12.3 · python3 3.12.3-0ubuntu2.1
Test inputs, results and environment
The exact published code ran in a dedicated Linux test container with prepared inputs. Unprivileged snippet process, external networking disabled, read-only root filesystem, and a fresh temporary working directory. Fixtures and output records are isolated from the application database. Testing covers this example and its stated checks, not every input, operating system, or runtime version. The Linux container shares its host's kernel; this is not a native Windows test.
- Architecture / host kernel
- x86_64 / 6.18.54.1-microsoft-standard-WSL2
- Snippet identity / locale
- uid=65534, gid=65534 (unprivileged) / C.UTF-8
- Interpreter invocation
python3 -c <published code>- Container image ID
sha256:32dc2d998158b6554c99b73b533f423696a0f3e31e8cbea9db10b5eee9a2fadd- Code SHA-256
50fb60d1419d2eca547f73e5f9916b249661519232f9eb7183a0dd45a25ab806- Dependencies
- python3 3.12.3-0ubuntu2.1
Test input setup
These are the prepared inputs used by the test harness. See Details above for the prerequisites and how to run this example.
# No input files required.
Observed standard output
[1, 3, 4, 5]
Exit code: 0. Standard error: empty. Validation: Exact stdout comparison. System-dependent values above are one recorded run.