sorted Array


 // Java implementation of QuickSort

import java.io.*;


class GFG{

// A utility function to swap two elements

static void swap(int[] arr, int i, int j)

{

int temp = arr[i];

arr[i] = arr[j];

arr[j] = temp;

}


/* This function takes last element as pivot, places

the pivot element at its correct position in sorted

array, and places all smaller (smaller than pivot)

to left of pivot and all greater elements to right

of pivot */

static int partition(int[] arr, int low, int high)

{

// pivot

int pivot = arr[high];

// Index of smaller element and

// indicates the right position

// of pivot found so far

int i = (low - 1);


for(int j = low; j <= high - 1; j++)

{

// If current element is smaller

// than the pivot

if (arr[j] < pivot)

{

// Increment index of

// smaller element

i++;

swap(arr, i, j);

}

}

swap(arr, i + 1, high);

return (i + 1);

}


/* The main function that implements QuickSort

arr[] --> Array to be sorted,

low --> Starting index,

high --> Ending index

*/

static void quickSort(int[] arr, int low, int high)

{

if (low < high)

{

// pi is partitioning index, arr[p]

// is now at right place

int pi = partition(arr, low, high);


// Separately sort elements before

// partition and after partition

quickSort(arr, low, pi - 1);

quickSort(arr, pi + 1, high);

}

}


// Function to print an array

static void printArray(int[] arr, int size)

{

for(int i = 0; i < size; i++)

System.out.print(arr[i] + " ");

System.out.println();

}


// Driver Code

public static void main(String[] args)

{

int[] arr = { 10, 7, 8, 9, 1, 5 };

int n = arr.length;

quickSort(arr, 0, n - 1);

System.out.println("Sorted array: ");

printArray(arr, n);

}

}


// This code is contributed by Ayush Choudhary


Comments

Post a Comment

Popular posts from this blog

Git and Github

Image
 git init :- to initilise the commuit  git status :- status check karna ka lia  git add (then file name) :-  git add sa hum file add karsakta haa git add file ka name  ls :- check karna ka lia  git add sa phela wo stage pe ata haa  then we have git commit for committing  git commit -m "initial commit" //git add file name ka bade git commit -m "initial commit" karna padta haa  cmd + k / clear     //clear karna ka lia git log :-  Git log is  a utility tool to review and read a history of everything that happens to a repository . git add .  karna sa sari file staging area mae ajaying ge git log will show all commites  git checkout  15ebcb8e1d62939377b5a2444ecd807e305a681e (has commit wala ) particular commit ko check karna ka lia  git checkout master           //pura wapas ajaya ga  git branch    // particular branch pe chala jaya ga  branch  git checkout -b bip/multiply              with the help of this we can add new branch  git checkout dev                         
Read more

bubble short Q1

  Bubble short assening order  5 9 8 -2 1 1st titration 4 comparison  2nd itteretion 3 comparison and so on  comparison = n-i; public   class  BubbleSortExample {        static   void  bubbleSort( int [] arr) {            int  n = arr.length;            int  temp =  0 ;             for ( int  i= 0 ; i < n; i++){                     for ( int  j= 1 ; j < (n-i); j++){                              if (arr[j- 1 ] > arr[j]){                                     //swap elements                                     temp = arr[j- 1 ];                                    arr[j- 1 ] = arr[j];                                    arr[j] = temp;                            }                                               }            }          }        public   static   void  main(String[] args) {                    int  arr[] ={ 3 , 60 , 35 , 2 , 45 , 320 , 5 };                                     System.out.println( "Array Before Bubble Sort" );                    for ( int  i= 0 ; 
Read more

Java Program to Check Whether the String Consists of Special Characters

 // Java Program to Check Whether String contains Special // Characters Using Character Class // Importing input output classes import java.io.*; // Main class class GFG { // Method 1 // Main driver method public static void main(String[] args) { // Declaring and initializing count for // special characters int count = 0; // Input custom string String s = "!#$GeeeksforGeeks.Computer.Science.Portal!!"; // Iterating through the string // using standard length() method for (int i = 0; i < s.length(); i++) { // Checking the character for not being a // letter,digit or space if (!Character.isDigit(s.charAt(i)) && !Character.isLetter(s.charAt(i)) && !Character.isWhitespace(s.charAt(i))) { // Incrementing the countr for spl // characters by unity count++; } } // When there is no special character encounterd if (count == 0) // Display the print statement System.out.println
Read more