dist-javascript-algorithms-and-data-structures
Version:
Algorithms and data-structures implemented on JavaScript
30 lines (27 loc) • 1.75 kB
JavaScript
"use strict";
var _euclideanAlgorithmIterative = _interopRequireDefault(require("../euclideanAlgorithmIterative"));
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
describe('euclideanAlgorithmIterative', () => {
it('should calculate GCD iteratively', () => {
expect((0, _euclideanAlgorithmIterative.default)(0, 0)).toBe(0);
expect((0, _euclideanAlgorithmIterative.default)(2, 0)).toBe(2);
expect((0, _euclideanAlgorithmIterative.default)(0, 2)).toBe(2);
expect((0, _euclideanAlgorithmIterative.default)(1, 2)).toBe(1);
expect((0, _euclideanAlgorithmIterative.default)(2, 1)).toBe(1);
expect((0, _euclideanAlgorithmIterative.default)(6, 6)).toBe(6);
expect((0, _euclideanAlgorithmIterative.default)(2, 4)).toBe(2);
expect((0, _euclideanAlgorithmIterative.default)(4, 2)).toBe(2);
expect((0, _euclideanAlgorithmIterative.default)(12, 4)).toBe(4);
expect((0, _euclideanAlgorithmIterative.default)(4, 12)).toBe(4);
expect((0, _euclideanAlgorithmIterative.default)(5, 13)).toBe(1);
expect((0, _euclideanAlgorithmIterative.default)(27, 13)).toBe(1);
expect((0, _euclideanAlgorithmIterative.default)(24, 60)).toBe(12);
expect((0, _euclideanAlgorithmIterative.default)(60, 24)).toBe(12);
expect((0, _euclideanAlgorithmIterative.default)(252, 105)).toBe(21);
expect((0, _euclideanAlgorithmIterative.default)(105, 252)).toBe(21);
expect((0, _euclideanAlgorithmIterative.default)(1071, 462)).toBe(21);
expect((0, _euclideanAlgorithmIterative.default)(462, 1071)).toBe(21);
expect((0, _euclideanAlgorithmIterative.default)(462, -1071)).toBe(21);
expect((0, _euclideanAlgorithmIterative.default)(-462, -1071)).toBe(21);
});
});