TypeScript

TypeScript copied to clipboard

Implemented the functions to raise to calculate the result of the power of another number using binary exponentiation that are mentioned in issue #10

NavinduDahanayakeOfficial

I have implemented the cocktail sort/cocktail shaker sorting algorithm.

codeme254

#### Summary of the Change: This pull request introduces the Euclidean distance algorithm, a method to calculate the distance between two vectors in a multi-dimensional space #### Motivation: I wanted...

Paulofalcao2002

yelinator

feat(dynamic programming -> knapsack): Update invalid example comment

2

sathish-pv

This PR adds the **Bisection Method** to the `maths` module. ### Changes: - Added `bisection` function to solve equations of the form `f(x) = 0`. - Created tests for the...

muhammedkucukaslan

I wrote two functions for the famous Goldbach's [conjecture](https://en.wikipedia.org/wiki/Goldbach%27s_conjecture), which basically says that for every natural number greater than 2, it can be rewritten as the sum of two primes....

djtrack16

[FEATURE]: Function for checking if array is sorted should check whether the array is sorted in both ascending and descending order.

5

### Motivation I have been looking at the code for checking whether an array is sorted and this is the current implementation: ```TypeScript export function isSortedArray(arr: number[]): boolean { for...

codeme254

Added the implementation for bijection method binary to decimal and Euler method

mapcrafter2048

Implemented the functions to isolate the decimal part of a number that are mentioned in the issue #10

NavinduDahanayakeOfficial