technojam/Ultimate_Algorithms_Repository

[NEW Algorithm]

Open

#301 opened on Oct 12, 2020

View on GitHub
 (1 comment) (0 reactions) (0 assignees)C++ (165 forks)auto 404
hacktoberfest

Repository metrics

Stars
 (87 stars)
PR merge metrics
 (PR metrics pending)

Description

Floyd's cycle detection algorithm

Floyd's cycle-finding algorithm is a pointer algorithm that uses only two pointers, which move through the sequence at different speeds. It is also called the "tortoise and the hare algorithm", alluding to Aesop's fable of The Tortoise and the Hare.

Contributor guide

Research direction
Implement Floyd's cycle detection algorithm. Refer to existing algorithm implementations in the repository for code style and structure.
Tech stack
cpp
Domain
data
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
C++Git
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
70