Js Algorithms
Open in Telegram
Only algorithms can save the world Creator @xodiyevlutfulloxonuz Blogs @myauditory Youtube https://www.youtube.com/XodiyevAcademy @jstutorial
Show more267
Subscribers
No data24 hours
No data7 days
No data30 days
Posts Archive
// function bubble_sort(array){
// for(let i=0; iarray[j+1]){
// let temp=array[j]
// array[j]=array[j+1]
// array[j+1]=temp
// }
// }
// }
// return array
// }
// console.log(bubble_sort([7,8,5,1,12,9,6]))
function bubble(array){
for(let i=0; iarray[i+1]){
[array[i], array[i+1]]=[array[i+1],array[i]]
}
}
return array
}
function bubble_sort(array){
for(let i=0; i
function selection_sort(array){
for(let i=0; iarray[j]){
minimum=j
}
}
//3
array[i]=array[minimum]
array[minimum]=temp
// arr[0]= arr[3] =4
}
return array
}
console.log(selection_sort([9,8,7,4,5]))
//9,8,7,4,5
//4,8,7,9,5
// 4,5,7,9,8
//4,5,7,9,8
//4,5,7,8,9
import java.util.Scanner;
public class main {
public static void main(String args[]) {
InterchangeMatrixDiagonal();
}
public static void InterchangeMatrixDiagonal(){
Scanner sc = new Scanner(System.in);
System.out.print("Enter rows and column of the matrix:");
int n=sc.nextInt();
int a[][] = new int [n][n];
System.out.println("Enter the elements of the matrix: ");
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
a[i][j]=sc.nextInt();
}
}
System.out.println("\nOriginal matrix: \n");
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println(" ");
}
for(int i=0; i<n; i++)
{
int temp = a[i][i];
a[i][i] = a[i][n-i-1];
a[i][n-i-1] = temp;
}
System.out.println("\nDiagonal Interchanged Matrix: \n");
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.println(" ");
}
}
}
function myFunction(nums1, nums2){
let newArr=[...nums1, ...nums2]
newArr.sort((a,b)=>{
return a-b
})
console.log(newArr)
if(newArr.length%2==1){
return newArr[Math.floor(newArr.length/2)]
}
return (newArr[newArr.length/2-1]+newArr[newArr.length/2])/2
}
console.log(myFunction([1,2,9], [3,6,16]))
Repost from JavaScript
leetcode.com saytidan masala yechishni davom etamiz.
Leetcode Median of Two Sorted Arrays Solution
Masala uchun link:
https://leetcode.com/problems/median-of-two-sorted-arrays/
Kanal @jstutorial
Yechim
function myFunction(nums1, nums2){
let newArr=[...nums1, ...nums2]
newArr.sort((a,b)=>{
return a-b
})
console.log(newArr)
if(newArr.length%2==0){
return (newArr[Math.floor(newArr.length/2-1)]+newArr[Math.floor(newArr.length/2)])/2
}
if(newArr.length%2==1){
return newArr[Math.floor(newArr.length/2)]
}
}
console.log(myFunction([1,3,6,7],[2,3,5,21,36,45]))
function myFunction(number, k, n){
newNumber=number.toString().split('')
if(newNumber.length>=k && newNumber.length>=n){
let temp=newNumber[k-1]
newNumber[k-1]=newNumber[n-1]
newNumber[n-1]=temp
newNumber=newNumber.join('')
return newNumber
}
else{
return " k yoki n ning pozitsiyasida xatolik bor. Qaytadan tekshiring"
}
}
console.log(myFunction(1367,1,3))
const removeProbels=function(str){
str=str.replace(/\s+/g, ' ')
return str;
}
console.log(removeProbels("Hammaga salom. Bugun kim darsga boradi?"))
Kanal @jsalgorithms
Repost from JavaScript
Azimjon Pulatov Software Engineer Bubble Sort algorithm ni juda yaxshi tushuntirib bergan ekan.
Manba:
https://youtu.be/cDkiKOlCw-g
Javascript uchun Bubble Sort algoritm
kod
function bubbleSort(nums){
let len=nums.length
for (let i=0; i<len-1; i++){
for (let j=0; j<len-1; j++){
if(nums[j]>nums[j+1]){
[nums[j],nums[j+1]]=[nums[j+1],nums[j]]
}
}
}
return nums
}
console.log(bubbleSort([-1,8,5,4,3,16,21,52,1]))
Kanal @jsalgorithms
