## Selection Sort – Java Implementation

What is Selection Sort?? Selection sort is a simple sorting algorithm that builds the sorted array one item at a time. This sorting is efficient for small data sets, not efficient for large data...

Skip to content
# Tagged: Beginner

##
Selection Sort – Java Implementation

##
Print Number with its Sign in Java

##
Valid Brackets – Part 2 | Stack Method

##
Find the roots of Quadratic Equation – Java Program

##
Given two strings validate the output string

##
Find Largest and Smallest word in a given String

##
Find two smallest elements in a given array

##
Front and Back Search in an Array

##
Print all Unique elements in a given array

##
Multiply with power of 2 without using pow() or * operator

##
Find first two largest elements in a given array

##
Calculate Logn base r – Java Implementation

##
Java Program to find Sum the elements of an Array

##
Insertion Sort – Java Implementation

##
Find Largest and Smallest word in a given String

Objective: Given a String, write a program to find largest and smallest word in it. Example: Input String: test Smallest Word: test Largest Word: test —————— Input String: This problem is solved at Algorithms...

@tutorialhorizon

What is Selection Sort?? Selection sort is a simple sorting algorithm that builds the sorted array one item at a time. This sorting is efficient for small data sets, not efficient for large data...

Sometimes we need to print the numbers with its sign irrespective of number is positive (+) or negative(-). Example: X = 5, print = +5 Y = -8, print = -8 Say we need...

Objective: Given a string containing just the characters ( , ) determine if the input string is valid. Example: ()()(()(()))() valid: true )()()( valid: false ()()) valid: false Approach: Earlier we discussed the solution which keeps...

Quadratic equation is in the form = ax2 + bx + c Discriminant (d) = b2 – 4ac Then roots are calculates using the equations below Root_1 = (-b + √d)/2a Root_2 = (-b...

Objective: Given two input strings and one output strings, validate if output string contains all the characters from both the input strings. Example: Input1 = “boy”, Input2 = “girl”, output = “gboilry” Result =...

Objective: Given a String, write a program to find largest and smallest word in it. Example: Input String: test Smallest Word: test Largest Word: test —————— Input String: This problem is solved at Algorithms...

Objective: Given an array of integers, write an algorithm to find the two smallest elements in the array. Example: Int [] a = { 6, 8, 1, 9, 2, 10}; Output: 1, 2 Int...

Objective: Given an unsorted array of numbers and a number ‘x’, write a java program to search the number ‘x’ in the array and return its index else return -1. Example: Int [] a...

Objective: Given an array of integers which contains duplicates as well. Write a program to print all unique elements in the array. This problem is also referred as print all distinct elements in the...

Objective: Given a number n and k, Calculate n * k2 without using pow() or *operator. Example: N = 3, k = 4 N*k2 = 48 Approach: Bit Manipulation Left shift the number N...

Objective: Given an array of integers, write an algorithm to find the first two largest elements in the array. Example: Int [] a = { 6, 8, 1, 9, 2, 1, 10}; Output: 10,...

Objective: Given a number n and r, write a program to calculate Logrn Example: N = 32, r =2 Log232= 5 N = 64, r = 4 Log464= 3 Approach: Without using built-In function-...

Objective: Given an array of integers, write a java program to find the sum of all elements Example: Input [] = {20, 30, 40, 10, 5, 2, 60, 73} Output: 240 Approach: Do a...

What is Insertion Sort?? Insertion sort is a simple sorting algorithm that builds the sorted array one item at a time. Efficient for small data sets, not efficient for large data sets. Most of...

%d bloggers like this: