Menu

Post image 1
Post image 2
1 / 2
0

Sorting Programs

DEV Community·PRIYA K·24 days ago
#iEoZinXe
Reading 0:00
15s threshold

1.Largest element in an array let arr = [ 5 , 3 , 8 , 1 , 2 ]; for ( let j = 0 ; j < 1 ; j ++ ) { for ( let i = 0 ; i < arr . length - 1 - j ; i ++ ) { if ( arr [ i ] > arr [ i + 1 ]) { let temp = arr [ i ]; arr [ i ] = arr [ i + 1 ]; arr [ i + 1 ] = temp ; } } } console . log ( " Largest Element: " , arr [ arr . length - 1 ]); Enter fullscreen mode Exit fullscreen mode 2.Second Largest Element let arr = [ 5 , 3 , 8 , 1 , 2 ]; for ( let j = 0 ; j < 2 ; j ++ ) { for ( let i = 0 ; i < arr . length - 1 - j ; i ++ ) { if ( arr [ i ] > arr [ i + 1 ]) { let temp = arr [ i ]; arr [ i ] = arr [ i + 1 ]; arr [ i + 1 ] = temp ; } } } console . log ( " Second Largest Element: " , arr [ arr . length - 2 ]); Enter fullscreen mode Exit fullscreen mode 3.Kth Largest Element let arr = [ 5 , 3 , 8 , 1 , 2 ]; let k = 3 ; for ( let j = 0 ; j < k ; j ++ ) { for ( let i = 0 ; i < arr .…

Continue reading — create a free account

Join HashtagPLUS to read full articles, follow hashtags, vote, and join the conversation.

Read More