Welcome Post

Hello guys This is my first post just to welcome you all.

Comments

Post a Comment

Popular posts from this blog

Day 7: Arrays - HackerRank 30 days of code solution

Objective Today, we're learning about the  Array  data structure. Check out the  Tutorial  tab for learning materials and an instructional video! Task Given an array,  , of   integers, print  's elements in  reverse  order as a single line of space-separated numbers. Input Format The first line contains an integer,   (the size of our array). The second line contains   space-separated integers describing array  's elements. Constraints , where   is the   integer in the array. Output Format Print the elements of array   in reverse order as a single line of space-separated numbers. Sample Input 4 1 4 3 2 Sample Output 2 3 4 1 Solution : import java.io.*; import java.util.*; import java.math.*;   public class Solution {       public static void main(String[] args) {       ...
Read more

Day 20: Sorting - HackerRank 30 days of code solution

Objective Today, we're discussing a simple sorting algorithm called  Bubble Sort . Consider the following version of Bubble Sort: for ( int i = 0 ; i < n ; i ++) { // Track number of elements swapped during a single array traversal int numberOfSwaps = 0 ; for ( int j = 0 ; j < n - 1 ; j ++) { // Swap adjacent elements if they are in decreasing order if ( a [ j ] > a [ j + 1 ]) { swap ( a [ j ], a [ j + 1 ]); numberOfSwaps ++; } } // If no elements were swapped during a traversal, array is sorted if ( numberOfSwaps == 0 ) { break ; } } Task Given an array,  , of size   distinct elements, sort the array in  ascending  order using the  Bubble Sort  algorithm above. Once sorted, print the following   lines: Array is sorted in numSwaps swaps. where   is the number ...
Read more

Bubble Sort Implementation - Java

Bubble Sort  is a simple algorithm which is used to sort a given set of n elements provided in form of an array with n  number of elements. Bubble Sort compares all the element one by one and sorts them based on their values. If the given array has to be sorted in ascending order, then bubble sort will start by comparing the first element of the array with the second element, if the first element is greater than the second element, it will  swap  both the elements, and then move on to compare the second and the third element, and so on. If we have total  n  elements, then we need to repeat this process for  n-1  times. It is known as  bubble sort , because with every complete iteration the largest element in the given array, bubbles up towards the last place or the highest index, just like a water bubble rises up to the water surface. Sorting takes place by stepping through all the elements one-by-one and comparing it with the adja...
Read more