derhuerst/sort-array-by-another

implement an in-place version

Open

#2 opened on Mar 16, 2020

View on GitHub
 (0 comments) (0 reactions) (0 assignees)JavaScript (0 forks)github user discovery
enhancementgood first issuehelp wanted

Repository metrics

Stars
 (0 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

An in-place sort won't need additional memory for a new sorted array.

Contributor guide

Research direction
Study the current algorithm, then design an in place variant by modifying the array without extra memory.
Tech stack
javascript
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
JavaScriptsorting algorithms
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
70