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...

Members Only Content
Log In Register Free Q&As


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] –> 2 moves reversing 10 & … Read...

Members Only Content
Log In Register Free Q&As


Swap 2 values & bubble sort in Java

Q1. Can you write an algorithm to swap two values? A1. Swapping without a temp variable Note: also try with * and \ Using bitwise “xor” Q2. Can you write code to bubble sort { 30, … Read more ›...

Members Only Content
Log In Register Free Q&As


Swapping, partitioning, and sorting algorithms in Java

Q1. Can you write an algorithm in Java to swap two variables? A1. Q2. Can you write an algorithm to bubble sort the following array { 30, 12, 18, 0, -5, 72, 424 }?? A2. … Read more ›...

Members Only Content
Log In Register Free Q&As


Java FAQs to Fast-track & Go places

Big Data Engineer FAQs

Java Interview Q&As

Note that some posts belong to multiple categories.
Top