Mozilla-Campus-Club-Cummins/Git-Avengers-Workshop

Binary Search on 2D array

Open

#8 opened on Mar 8, 2023

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Java (63 forks)auto 404
good first issue

Repository metrics

Stars
 (1 star)
PR merge metrics
 (No merged PRs in 30d)

Description

Write a program to check if number is present in sorted 2D array or not using binary search

Contributor guide

Research direction
Implement binary search on a sorted 2D array by treating it as a 1D array or using row/column pointers.
Tech stack
java
Domain
backend
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.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
JavaBinary search
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
80