moni sharma
quick sort
1 Answer(s)      6 years and 3 months ago
Posted in : Java Beginners

sir, i try to modify this one as u sugess me in previous answer "array based problem" for run time input.but i am facing some problem.plz solve this one also.

import java.util.*; public class QuickSort1 { public static void quick_srt(int array[],int low, int n){ int lo = low; int hi = n; if (lo >= n) { return; } int mid = array[(lo + hi) / 2]; while (lo < hi) { while (lo mid) { hi--; } if (lo < hi) { int T = array[lo]; array[lo] = array[hi]; array[hi] = T; } } if (hi < lo) { int T = hi; hi = lo; lo = T; } quick_srt(array, low, lo); quick_srt(array, lo == low ? lo+1 : lo, n); }

public static void main(String a[]){ Scanner input=new Scanner(System.in); int array[]=new int[10]; int i;

```    System.out.println("       Quick Sort\n\n");
System.out.println("Values Before the sort:\n");
for(i = 0; i < array.length; i++){
array[i]=input.nextInt();
}
for(i = 0; i < array.length; i++){
System.out.println(array[i]);
}

quick_srt(array,0,array.length-1);
System.out.print("Values after the sort:\n");
for(i = 0; i <array.length; i++)
System.out.print(array[i]+"  ");
System.out.println();

System.out.println("PAUSE");
```

}

}

January 5, 2011 at 10:13 AM

Hi Friend,

Here is required code:

```import java.util.*;
public class QuickSort1 {
public static void main(String a[]){
int i;
int array[] = new int[5];
Scanner input=new Scanner(System.in);
System.out.println("       Quick Sort\n\n");
System.out.println("Values Before the sort:\n");
for(i = 0; i < array.length; i++){
array[i]=input.nextInt();
}
quick_srt(array,0,array.length-1);
System.out.print("Values after the sort:\n");
for(i = 0; i <array.length; i++)
System.out.print(array[i]+"  ");
System.out.println();
System.out.println("PAUSE");
}

public static void quick_srt(int array[],int low, int n){
int lo = low;
int hi = n;
if (lo >= n) {
return;
}
int mid = array[(lo + hi) / 2];
while (lo < hi) {
while (lo<hi && array[lo] < mid) {
lo++;
}
while (lo<hi && array[hi] > mid) {
hi--;
}
if (lo < hi) {
int T = array[lo];
array[lo] = array[hi];
array[hi] = T;
}
}
if (hi < lo) {
int T = hi;
hi = lo;
lo = T;
}
quick_srt(array, low, lo);
quick_srt(array, lo == low ? lo+1 : lo, n);
}
}
```

Thanks

quick sort
; System.out.println(" Quick Sort\n\n"); System.out.println("Values Before...quick sort  sir, i try to modify this one as u sugess me in previous... static void quick_srt(int array[],int low, int n){ int lo = low; int hi
quick sort
; System.out.println(" Quick Sort\n\n"); System.out.println("Values Before...quick sort  sir, i try to modify this one as u sugess me in previous... static void quick_srt(int array[],int low, int n){ int lo = low; int hi
quick sort
; System.out.println(" Quick Sort\n\n"); System.out.println("Values Before...quick sort  sir, i try to modify this one as u sugess me in previous... static void quick_srt(int array[],int low, int n){ int lo = low; int hi
Quick Sort In Java
Quick Sort in Java      ... to sort integer values of an array using quick sort. Quick sort algorithm is developed by C. A. R. Hoare. Quick sort is a comparison sort. The working
Quick Sort in Java
Quick sort in Java is used to sort integer values of an array. It is a comparison sort. Quick sort is one of the fastest and simplest sorting algorithm... sort, etc. The complexity of quick sort in the average case is Θ(n log n
Quick Sort in Java
Quick Sort in Java Quick Sort in Java is used to sort elements of an array. Quick sort works on divide and conquer strategy and comparison sort... into two sub-arrays. The complexity of quick sort in the average case is &Theta
Sort
Sort  program to sort a list of numbers in decendimg order   Hi Friend, Try the following code: import java.util.*; class SortListInDescendingOrder{ public static void main(String[] args
Waiting for ur quick response
Waiting for ur quick response  Hi, I have two different java programs like sun and moon. In both of these two programs i have used same class name like A. For example, File name:sun.java Then the code is here: Class
bubble sort
bubble sort  how to calculate the number of passes in bubble sort
insertion sort
insertion sort  how many arrays needed for insertion sort and why
bubble sort
bubble sort  write a program in java using bubble sort
insertion sort
insertion sort  write a program in java using insertion sort
insertion sort
insertion sort  write a program in java using insertion sort
insertion sort
insertion sort  write a program in java using insertion sort
insertion sort
insertion sort  write a program in java using insertion sort
Array sort
Array sort  Program that uses a function to sort an array of integers
buble sort
buble sort  ascending order by using Bubble sort programm   Java BubbleSort Example
Struts Quick Start
Struts Quick Start Struts Quick Start to Struts technology In this post I will show you how you can quick start the development of you struts based project... of the application fast. Read more: Struts Quick Start
SEARCH AND SORT
SEARCH AND SORT  Cam any one provide me the code in java that : Program to search for MAX,MIN and then SORT the set using any of the Divide and conquer method
Please help need quick!!! Thanks  hey i keep getting stupid compile errors and don't understand why. i'm supposed to use abstract to test a boat race simulation program of sorts here is my code: RentforthBoatRace.java public
php array sort by value
php array sort by value  an example to sort the array by value
php array sort by key
php array sort by key  php script to sort array by key
php array sort by field
php array sort by field  Array sort by field in PHP
php array sort functions
php array sort functions  Sort function in php
Insertion Sort In Java
. There are more efficient algorithms such as quick sort, heap sort, or merge sort... Insertion Sort In Java     ... In this example we are going to sort integer values of an array using insertion sort
i need a quick response about array and string...
i need a quick response about array and string...  how can i make a dictionary type using array code in java where i will type the word then the meaning will appear..please help me..urgent
Tomcat Quick Start Guide
Tomcat Quick Start Guide       This tutorial is a quick reference of starting development application using JSP, Servlets and JDBC technologies. In this quick and very
Insertion Sort Applet
Insertion Sort Applet  I need Insertion Sort Applet code was design by Dr. Daniel Liang Please
Insertion Sort Applet
Insertion Sort Applet  Please All , I need Insertion sort applet program
insertion sort applet code
insertion sort applet code  i need Insertion Sort Applet Program
Tutorials