"bubble sort in c++" Code Answer's

bubble sort in c++

By poinapole on May 04, 2021

void bubble_sort( int A[ ], int n ) {
    int temp;
    for(int k = 0; k< n-1; k++) {
        // (n-k-1) is for ignoring comparisons of elements which have already been compared in earlier iterations

        for(int i = 0; i < n-k-1; i++) {
            if(A[ i ] > A[ i+1] ) {
                // here swapping of positions is being done.
                temp = A[ i ];
                A[ i ] = A[ i+1 ];
                A[ i + 1] = temp;
            }
        }
    }
}

Source: www.hackerearth.com

Add Comment

bubble sort in java

By GelatinousMustard on Apr 15, 2020

public static void bubbleSort(int arr[])
{
	for (int i = 0; i < arr.length; i++) //number of passes
    {
		//keeps track of positions per pass      
    	for (int j = 0; j < (arr.length - 1 - i); j++) //Think you can add a -i to remove uneeded comparisons 
        {
          	//if left value is great than right value 
        	if (arr[j] > arr[j + 1])
            {
              	//swap values
            	int temp = arr[j];
              	arr[j] = arr[j + 1];
              	arr[j + 1] = temp; 
            }
        }
    }
}

Add Comment

Heap sort in c++

By VeNOM on Dec 08, 2020

#include <iostream>
 
using namespace std;
 

void heapify(int arr[], int n, int i)
{
    int largest = i; 
    int l = 2 * i + 1;
    int r = 2 * i + 2;
 
    
    if (l < n && arr[l] > arr[largest])
        largest = l;
 
    
    if (r < n && arr[r] > arr[largest])
        largest = r;
 
    
    if (largest != i) {
        swap(arr[i], arr[largest]);
 
    
        heapify(arr, n, largest);
    }
}
 

void heapSort(int arr[], int n)
{

    for (int i = n / 2 - 1; i >= 0; i--)
        heapify(arr, n, i);
 

    for (int i = n - 1; i > 0; i--) {
       
        swap(arr[0], arr[i]);
        heapify(arr, i, 0);
    }
}
 

void printArray(int arr[], int n)
{
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";
    cout << "\n";
}
 

int main()
{
    int arr[] = { 12, 11, 13, 5, 6, 7 };
    int n = sizeof(arr) / sizeof(arr[0]);
 
    heapSort(arr, n);
 
    cout << "Sorted array is \n";
    printArray(arr, n);
}

Add Comment

bubble sort code

By Talented Tern on Aug 16, 2020

func Sort(arr []int) []int {
	for i := 0; i < len(arr)-1; i++ {
		for j := 0; j < len(arr)-i-1; j++ {
			if arr[j] > arr[j+1] {
				temp := arr[j]
				arr[j] = arr[j+1]
				arr[j+1] = temp
			}
		}
	}
	return arr
}

Add Comment

c++ buble sort

By Vivacious Vulture on Nov 30, 2020

void bubbleSort(int arr[], int size){
  int temp = int();
  //print out the unsorted values
  for ( int i = 0; i < size -1; i ++)
    cout << arr[i] << "\t";
  cout << endl << endl;
  
  
  for (int i = 1; i < size; i++ ){
  	for(int j = 0; j < size - i ; j ++){//size-i is the sorted part of the array	
   		if( arr[j] > arr[j + 1]){//if the value is greater than the next value in the array, swap it
          temp = arr[j];
          arr[j] = arr[j+1];//swap the two values
          arr[j+1] = temp;
          
        }//end if
    }//end for
  }//end for
  
}//end bubbleSort

Add Comment

code for bubble sort in c++

By Hurt Heron on May 01, 2021

void bubbleSort (int S[ ],  int length) {
	bool isSorted = false;
	while(!isSorted)
   	{
		isSorted = true;
		for(int i = 0; i<length; i++)
      	{
		     if(S[i] > S[i+1])
           	     {
			int temp = S[i];
			S[i] = S[i+1];
     	       		S[i+1] = temp;
            		isSorted = false;
           	      }
      	}
      	length--;
}
}

Add Comment