Find max recursion #1008

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,38 @@
	/**
	* @function findMaxRecursion
	* @description This algorithm will find the maximum value of a array of numbers.
	*
	* @param {Integer[]} arr Array of numbers
	* @param {Integer} left Index of the first element
	* @param {Integer} right Index of the last element
	*
	* @return {Integer} Maximum value of the array
	*
	* @see [Maximum value](https://en.wikipedia.org/wiki/Maximum_value)
	*
	* @example findMaxRecursion([1, 2, 4, 5]) = 5
	* @example findMaxRecursion([10, 40, 100, 20]) = 100
	* @example findMaxRecursion([-1, -2, -4, -5]) = -1
	*/
	function findMaxRecursion(arr, left, right) {
	const len = arr.length

	if (len === 0 \|\| !arr) return undefined

	if (left >= len \|\| left < -len \|\| right >= len \|\| right < -len)
	throw new Error('Index out of range')

	if (left === right) return arr[left]

	// left + right shifted is the middle index
	const mid = (left + right) >> 1
Copy link Collaborator @appgurueu appgurueu May 8, 2022 Choose a reason for hiding this comment The reason will be displayed to describe this comment to others. Learn more. please explain this as `x >> y == floor(x / pow(2, y))`

	// Find the maximum of left and right
	const leftMax = findMaxRecursion(arr, left, mid)
	const rightMax = findMaxRecursion(arr, mid + 1, right)

	// Return the maximum
	return Math.max(leftMax, rightMax)
	}

	export { findMaxRecursion }

58 changes: 58 additions & 0 deletions Maths/test/FindMaxRecursion.test.js

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,58 @@
	import { findMaxRecursion } from '../FindMaxRecursion'

	describe('Test findMaxRecursion function', () => {
	const positiveAndNegativeArray = [1, 2, 4, 5, -1, -2, -4, -5]
	const positiveAndNegativeArray1 = [10, 40, 100, 20, -10, -40, -100, -20]

	const positiveArray = [1, 2, 4, 5]
	const positiveArray1 = [10, 40, 100, 20]

	const negativeArray = [-1, -2, -4, -5]
	const negativeArray1 = [-10, -40, -100, -20]

	const zeroArray = [0, 0, 0, 0]
	const emptyArray = []

	it('Testing with positive arrays', () => {
	expect(findMaxRecursion(positiveArray, 0, positiveArray.length - 1)).toBe(5)
	expect(findMaxRecursion(positiveArray1, 0, positiveArray1.length - 1)).toBe(
	100
	)
	})

	it('Testing with negative arrays', () => {
	expect(findMaxRecursion(negativeArray, 0, negativeArray.length - 1)).toBe(
	-1
	)
	expect(findMaxRecursion(negativeArray1, 0, negativeArray1.length - 1)).toBe(
	-10
	)
	})

	it('Testing with positive and negative arrays', () => {
	expect(
	findMaxRecursion(
	positiveAndNegativeArray,
	0,
	positiveAndNegativeArray.length - 1
	)
	).toBe(5)
	expect(
	findMaxRecursion(
	positiveAndNegativeArray1,
	0,
	positiveAndNegativeArray1.length - 1
	)
	).toBe(100)
	})

	it('Testing with zero arrays', () => {
	expect(findMaxRecursion(zeroArray, 0, zeroArray.length - 1)).toBe(0)
	})

	it('Testing with empty arrays', () => {
	expect(findMaxRecursion(emptyArray, 0, emptyArray.length - 1)).toBe(
	undefined
	)
	})
	})

25 changes: 25 additions & 0 deletions Search/test/YoutubeVideoAssociation.test.js

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,25 @@
	import AssociationAlgorithm from '../YoutubeVideoAssociation'
Copy link Member @raklaptudirm raklaptudirm May 8, 2022 Choose a reason for hiding this comment The reason will be displayed to describe this comment to others. Learn more. Remove these changes from here.

	describe('Youtube Video Association Algorithm', () => {
	const search = {
	video: {
	id: 'dQw4w9WgXcQ',
	views: '100'
	},
	search: {
	query: 'Rick Roll'
	}
	}

	const algorithm = new AssociationAlgorithm(10)

	test('The video should not be associated after one search', () => {
	algorithm.search(search)

	expect(algorithm.isVideoAssociated('dQw4w9WgXcQ', 'Rick Roll')).toBe(false)
	})

	test('The video should be associated after 11 searches', () => {
	for (let i = 0; i < 10; i++) algorithm.search(search)
	})
	})

Navigation Menu