Skip to content

Instantly share code, notes, and snippets.

View Neptune998's full-sized avatar
🎯
Focusing

Gopesh Yadav Neptune998

🎯
Focusing
View GitHub Profile
def fun():
return "Hello"
fun()
def fun():
return "Hemmo"
function reverseString(s) {
try{
console.log(s.split('').reverse().join(''));
}
catch(e){
console.log(e.message);
console.log(s);
}
}
function factorial(n){
if(n===0){
return 1;
}
else{
return n* factorial(n-1);
}
}
function main() {
// Write your code here. Read input using 'readLine()' and print output using 'console.log()'.
const PI = Math.PI;
var s = readLine();
// Print the area of the circle:
console.log(PI*parseFloat(s)*parseFloat(s));
// Print the perimeter of the circle:
console.log(2*PI*parseFloat(s));
function getSecondLargest(arr) {
let max = -Infinity, result = -Infinity;
for (const value of arr) {
const next_ele = Number(value)
if (next_ele > max) {
[result, max] = [max, next_ele] // save previous max
}
else if (next_ele < max && next_ele > result)
// Use rectangle class to find the area of Square.
class Rectangle {
constructor(w, h) {
this.w = w;
this.h = h;
}
}
// Rectangle class Method to find the area.
Rectangle.prototype.area = function() {
return(this.w*this.h);
/*
* Implement a Polygon class with the following properties:
* 1. A constructor that takes an array of integer side lengths.
* 2. A 'perimeter' method that returns the sum of the Polygon's side lengths.
*/
class Polygon {
constructor(sides) {
this.sides = sides;
}
# Bubble sort
def bubble_sort(arr, itr):
lgth = len(arr)
for i in range(lgth):
for j in range(lgth-i-1):
if arr[j]>arr[j+1]:
arr[j],arr[j+1] = arr[j+1],arr[j]
print("Iteration:",i,arr)
itr+=1
@Neptune998
Neptune998 / insertion_algo.py
Created August 13, 2020 17:15
Insertion Sort Algorithm
# Insertion Sort Algorithm
i1
while i < length(A)
ji
while j > 0 and A[j-1] > A[j]
swap A[j] and A[j-1]
jj - 1
end while
ii + 1
end while