Skip to content

Handle negative input in fibonacci implementation #1881

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
MayankSharma-2812 wants to merge 10 commits into
base: master
Choose a base branch
from
Open

Handle negative input in fibonacci implementation #1881

Changes from 1 commit
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
22399de
Improve N-Queens input validation and solution counting clarity
MayankSharma-2812 Jan 22, 2026
a52354a
Add input validation for empty or invalid array in binary search
MayankSharma-2812 Jan 23, 2026
da50af3
Add Quick Sort implementation in JavaScript
MayankSharma-2812 Jan 24, 2026
b135a51
Handle empty array input in selection sort
MayankSharma-2812 Jan 25, 2026
ddf6fb2
Avoid mutating input array in bubble sort implementations
MayankSharma-2812 Jan 26, 2026
b9fd4f8
Add input validation to longest subarray sum algorithm
MayankSharma-2812 Jan 27, 2026
ff5be5b
Add input validation to coin change algorithms
MayankSharma-2812 Jan 30, 2026
142c98c
Add input validation to longest palindromic subsequence
MayankSharma-2812 Jan 31, 2026
569e554
Add input validation to rod cutting algorithm
MayankSharma-2812 Feb 1, 2026
4c22a69
Handle negative input in fibonacci implementation
MayankSharma-2812 Feb 2, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Handle empty array input in selection sort
  • Loading branch information
@MayankSharma-2812
MayankSharma-2812 committed Jan 25, 2026
commit b135a5156652c5a8ad22324e065a8e8e73f40293
8 changes: 7 additions & 1 deletion Sorts/SelectionSort.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,13 @@ export const selectionSort = (list) => {
if (!Array.isArray(list)) {
throw new TypeError('Given input is not an array')
}
const items = [...list] // We don't want to modify the original array

if (list.length === 0) {
return []
}

const items = [...list]

const length = items.length
for (let i = 0; i < length - 1; i++) {
if (typeof items[i] !== 'number') {
Expand Down