Harsh Raj

Results 172 issues of Harsh Raj

### Description Write a Julia program to implement binary search Binary search is a fast search algorithm with run-time complexity of Ο(log n). This search algorithm works on the principle...

good first issue
triage
Julia
program

### Description Write a Ruby program to implement binary search Binary search is a fast search algorithm with run-time complexity of Ο(log n). This search algorithm works on the principle...

good first issue
triage
Ruby
program

### Description Write a Haskell program to find the smallest three elements in an array ```txt Input : arr[] = {10, 4, 3, 50, 23, 90} Output : 3 4...

good first issue
triage
Haskell
program

### Description Write a Swift program to find the smallest three elements in an array ```txt Input : arr[] = {10, 4, 3, 50, 23, 90} Output : 3 4...

good first issue
triage
Swift
program

### Description Write a Julia program to implement jump search Like Binary Search, Jump Search is a searching algorithm for sorted arrays. The basic idea is to check fewer elements...

good first issue
triage
Julia
program

### Description Write a program to find factorial of a number Factorial of N = N *(N-1)* (N-2) *...* 1 ``` Input : 5 Output : 120 ``` ### Tracking...

auto-track
program

### Description Write a program to convert binary to octal Binary is a base-2 number system. It uses only two digits: 0 and 1. The digits are called bits. A...

auto-track
program

### Description Write a program to print pascal's triangle Pascal's triangle is a triangular array of the binomial coefficients. Write a function that takes an integer value `n` as input...

auto-track
program

### Description Write a program to print number to words ``` Input : 123456789 Output : One Hundred Twenty Three Million Four Hundred Fifty Six Thousand Seven Hundred Eighty Nine...

auto-track
program

### Description Write a program to convert seconds to hours 1 hour = 60 minutes = 3600 seconds ``` Input : 18000 Output : 5 ``` ### Tracking Issues -...

auto-track
program