Coding - Sorting Algo Archives | 800+ Java & Big Data Interview Q&As

Blog Archives

Quick Sort in Java

Q. Is there a more efficient sorting algorithm than bubble sorting? A. Although bubble-sort is one of the simplest sorting algorithms, it’s also one of the slowest. It has the O(n2) time complexity. Faster algorithms include quick-sort and heap-sort. The Arrays.sort( ) method uses the quick-sort algorithm, … Read more...

This content is for 30-Day-Full-Access, 100-Day-Full-Access, 200-Day-Full-Access, and 365-Day-Full-Access members only. Register 80+ Free Java FAQs 80+ Free Big Data FAQs

Already a member? Log in here

Sorting by reversing the entries in Java

Q. You need to sort an array of integers by repeatedly reversing the order of the first several elements of it. you always have to flip from the beginning element, you cannot flip elements 2 and 3. For example, input: [10,30,20] [10,30,20] –> … Read more ›...

This content is for 30-Day-Full-Access, 100-Day-Full-Access, 200-Day-Full-Access, and 365-Day-Full-Access members only. Register 80+ Free Java FAQs 80+ Free Big Data FAQs

Already a member? Log in here

Swap 2 values & bubble sort in Java

Q1. Can you write an algorithm to swap two values? A1.

package algorithms;

public class Swap {
    
    public static void main(String[ ] args) {
        int x = 5;
        int y = 6;
        
        //store 'x' in a temp variable
        int temp = x;
        x = y;
        y = temp;
        
        System.out.println("x=" + x + ",y=" + y);
   }
}

package algorithms;

public class Swap {

public static void main(String[ ] args) {

int x = 5;

int y = 6;

//store 'x' in a temp variable

int temp = x;

x = y;

y = temp;

System.out.println("x=" + x + ",y=" + y);

}

Swapping without a temp variable

package algorithms;

public class Swap {
    
    public static void main(String[ ] args) {
        int x = 5;
        int y = 6;
        
        //without using  a temp variable
        x = x + y;  // 11
        y = x - y;  // 5
        x = x - y;  //6
        
        System.out.println("x=" + x + ",y=" + y);
   }
}

package algorithms;

public class Swap {

public static void main(String[ ] args) {

int x = 5;

int y = 6;

//without using a temp variable

x = x + y; // 11

y = x - y; // 5

x = x - y; //6

System.out.println("x=" + x + ",y=" + y);

}

Note: also try with * and \ Using bitwise “xor”

package algorithms;

public class Swap {
    
    public static void main(String[ ] args) {
        int x = 5;
        int y = 6;
        
        //without using  a temp variable
        //^ is xor 0 ^ 0 = 0, 0 ^ 1 = 1, 1 ^ 0 = 1, 0 ^ 0 = 0
        x = x ^ y;  // 3
        y = x ^ y;  // 5
        x = x ^ y;  //6
        
        System.out.println("x=" + x + ",y=" + y);
   }
}

package algorithms;

public class Swap {

public static void main(String[ ] args) {

int x = 5;

int y = 6;

//without using a temp variable

//^ is xor 0 ^ 0 = 0, 0 ^ 1 = 1, 1 ^ 0 = 1, 0 ^ 0 = 0

x = x ^ y; // 3

y = x ^ y; // 5

x = x ^ y; //6

System.out.println("x=" + x + ",y=" + y);

}

Q2. … Read more ›...

This content is for 30-Day-Full-Access, 100-Day-Full-Access, 200-Day-Full-Access, and 365-Day-Full-Access members only. Register 80+ Free Java FAQs 80+ Free Big Data FAQs

Already a member? Log in here

Swapping, partitioning, and sorting algorithms in Java

Q1. Can you write an algorithm in Java to swap two variables? A1.

public class Swap {
    
    public static void main(String[ ] args) {
        int x = 5;
        int y = 6;
        
        //store 'x' in a temp variable
        int temp = x;
        x = y;
        y = temp;
        
        System.out.println("x=" + x + ",y=" + y);
   }
}

public class Swap {

public static void main(String[ ] args) {

int x = 5;

int y = 6;

//store 'x' in a temp variable

int temp = x;

x = y;

y = temp;

System.out.println("x=" + x + ",y=" + y);

}

Q2. Can you write an algorithm to bubble sort the following array { 30, 12, 18, 0, -5, 72, 424 }?? … Read more ›...

This content is for 30-Day-Full-Access, 100-Day-Full-Access, 200-Day-Full-Access, and 365-Day-Full-Access members only. Register 80+ Free Java FAQs 80+ Free Big Data FAQs

Already a member? Log in here

Blog Archives

Quick Sort in Java

Sorting by reversing the entries in Java

Swap 2 values & bubble sort in Java

Swapping, partitioning, and sorting algorithms in Java

300+ Java Interview Questions - FAQs

10+ Companion Techs Interview Q&As

300+ Big Data Interview Questions - FAQs

16+ Java Tech Key Areas Interview Q&As

Your Career Tips to go places

Tutorials on Java & Big Data

300+ Java Interview Questions Answered

Disclaimer