Breaking News: Grepper is joining You.com. Read the official announcement!

how does sorting array works in c++

Add Answer

Xixika answered on August 9, 2021 Popularity 10/10 Helpfulness 1/10

answer how does sorting array works in c++

related C++ array sort method

related sort an array in C++

related sort array c++

related sort an array in c++

related sort c++ array

how does sorting array works in c++

Comment

/*
so lets create an array called 'arr' which is size of n and iterate ever it with
double loop and since we want to sort the array, then we want to place lowest 
values of the array, at the very beggining of it, so while iterating, we keep 
the lowest values we meet, and replace it with the current position.

for example:                                         
if we arecurrenty at the index 2, and array looks like this : [0,1,5,6,2,3], our 
current value is 5, so when iterating to the end, our minimal value should be 2,
and if we swipe their indexes, it will look like this : [0,1,2,6,5,3].
if we do exact same operation, but with the next index which is 3(because 
previous index was 2), our current value is 6, and if we iterate over it, we
meet the minimal value of 3, so when we swap their positions, we get something
like this : [0,1,2,3,5,6]. and thats it, our array is sorted.But iteration is
not finished yet, we are still at index 4, but our value is 5, and the minimal
value on the right side of it is 6, which is more that our value, which means
we should skip this part, and only after this, our alglorithm is over which looks
something like this:
*/
for(int i = 0; i < n-1; i++){
	int curr = arr[i]; // current minimal value
    int indx = i; // index of current minimal value
    for(int j = i; j < n; j++){ // iterating on eveny value that is on right side
     	if(curr > arr[j]){// if some value is less than current minimal,
        	curr = arr[j]; // we make it minimal
           	indx = j; // and it's index minimal.
        }
    }
// after all of that, we swap values of current position, and the minimal value
// using index of minimal value.
    int temp = arr[i]; 
  	arr[i] = arr[indx];
    arr[indx] = temp;
}
// I hope it helped you understanding how sorting works :)
// Good luck in your future projects.

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++ sorting

Link to this answer
Share Copy Link

Contributed on Apr 28 2022

Xixika

0 Answers Avg Quality 2/10

Closely Related Answers

C++ array sort method

Comment

#include <algorithm>
#include <iostream>
#include <array>
using namespace std;

int main() {
    array<int, 5> arraysort{ 4,2,3,5,1 };
    sort(arraysort.begin(), arraysort.end());
    for (int i = 0; i < arraysort.size(); i++) {
        cout << arraysort[i] << " ";
    }
	return 0; 
}

Popularity 10/10 Helpfulness 4/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Aug 09 2021

Sangkan197

0 Answers Avg Quality 2/10

sort an array in C++

Comment

// C++ program to demonstrate default behaviour of
// sort() in STL.
#include <iostream>
#include<algorithm>
using namespace std;

int main()
{
    int arr[] = { 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 };
    int n = sizeof(arr) / sizeof(arr[0]);

    /*Here we take two parameters, the beginning of the
    array and the length n upto which we want the array to
    be sorted*/
    sort(arr, arr + n);

    cout << "\nArray after sorting using "
        "default sort is : \n";
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";
    return 0;
}

Popularity 9/10 Helpfulness 4/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jan 06 2023

Cruel Copperhead

0 Answers Avg Quality 2/10

sort array c++

Comment

//me
int arr[6] = {3,1,4,0,5,2};
sort(arr, arr+6);

//arr is now {0,1,2,3,4,5}

Popularity 10/10 Helpfulness 4/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Feb 03 2022

Elated Earthworm

0 Answers Avg Quality 2/10

sort an array in c++

Comment

int A[n];
//if size of array is n then use
sort(A,A+n);
// sort function uses best algorithm avaible to sort array A. 
// Time complexity of sort function is O(n*logn)

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Apr 24 2022

BT20CSE083 Vaibhav

0 Answers Avg Quality 2/10

sort c++ array

Comment

sort(A + 1, A + n + 1);

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: www.pbinfo.ro

Tags: c++

Link to this answer
Share Copy Link

Contributed on Mar 08 2022

RocoMax Book

0 Answers Avg Quality 2/10

how does sorting array works in c++

Contents

More Related Answers

how does sorting array works in c++

Closely Related Answers

C++ array sort method

sort an array in C++

sort array c++

sort an array in c++

sort c++ array

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.