Skip to content

test: add tests for Eucledian GCD Algorithm #1539

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

Closed
wants to merge 2 commits into from
Closed

test: add tests for Eucledian GCD Algorithm #1539

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
877e607
test: add tests for Eucledian GCD Algorithm
Oct 14, 2023
edc51b2
test: add tests for Binary Equivalent Algorithm
Oct 14, 2023
File filter

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
test: add tests for Binary Equivalent Algorithm
  • Loading branch information
{Harshit Malpotra} committed Oct 14, 2023
commit edc51b27edf0960dded41069dcdd7018c1f0ef7f
16 changes: 16 additions & 0 deletions Recursive/test/BinaryEquivalent.test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
import { binaryEquivalent } from "../BinaryEquivalent";

describe("BinaryEquivalent", () => {
it('The binary equivalent of 2 should be "10"', () => {
expect(binaryEquivalent(2)).toBe("10");
})
it('The binary equivalent of 0 should be "0"', () => {
expect(binaryEquivalent(0)).toBe("0");
})
it('The binary equivalent of 543 should be "1000011111"', () => {
expect(binaryEquivalent(543)).toBe("1000011111");
})
it('The binary equivalent of 4697621023 should be "100011000000000000000001000011111"', () => {
expect(binaryEquivalent(4697621023)).toBe("100011000000000000000001000011111");
})
})