dist-javascript-algorithms-and-data-structures
Version:
Algorithms and data-structures implemented on JavaScript
28 lines (25 loc) • 1.94 kB
JavaScript
"use strict";
var _interpolationSearch = _interopRequireDefault(require("../interpolationSearch"));
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
describe('interpolationSearch', () => {
it('should search elements in sorted array of numbers', () => {
expect((0, _interpolationSearch.default)([], 1)).toBe(-1);
expect((0, _interpolationSearch.default)([1], 1)).toBe(0);
expect((0, _interpolationSearch.default)([1], 0)).toBe(-1);
expect((0, _interpolationSearch.default)([1, 1], 1)).toBe(0);
expect((0, _interpolationSearch.default)([1, 2], 1)).toBe(0);
expect((0, _interpolationSearch.default)([1, 2], 2)).toBe(1);
expect((0, _interpolationSearch.default)([10, 20, 30, 40, 50], 40)).toBe(3);
expect((0, _interpolationSearch.default)([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15], 14)).toBe(13);
expect((0, _interpolationSearch.default)([1, 6, 7, 8, 12, 13, 14, 19, 21, 23, 24, 24, 24, 300], 24)).toBe(10);
expect((0, _interpolationSearch.default)([1, 2, 3, 700, 800, 1200, 1300, 1400, 1900], 600)).toBe(-1);
expect((0, _interpolationSearch.default)([1, 2, 3, 700, 800, 1200, 1300, 1400, 1900], 1)).toBe(0);
expect((0, _interpolationSearch.default)([1, 2, 3, 700, 800, 1200, 1300, 1400, 1900], 2)).toBe(1);
expect((0, _interpolationSearch.default)([1, 2, 3, 700, 800, 1200, 1300, 1400, 1900], 3)).toBe(2);
expect((0, _interpolationSearch.default)([1, 2, 3, 700, 800, 1200, 1300, 1400, 1900], 700)).toBe(3);
expect((0, _interpolationSearch.default)([1, 2, 3, 700, 800, 1200, 1300, 1400, 1900], 800)).toBe(4);
expect((0, _interpolationSearch.default)([0, 2, 3, 700, 800, 1200, 1300, 1400, 1900], 1200)).toBe(5);
expect((0, _interpolationSearch.default)([1, 2, 3, 700, 800, 1200, 1300, 1400, 19000], 800)).toBe(4);
expect((0, _interpolationSearch.default)([0, 10, 11, 12, 13, 14, 15], 10)).toBe(1);
});
});