stl for sorting IN C++
// STL IN C++ FOR SORING #include <bits/stdc++.h> #include <iostream> using namespace std; int main() { int arr[] = {1, 5, 8, 9, 6, 7, 3, 4, 2, 0}; int n = sizeof(arr)/sizeof(arr[0]); sort(arr, arr+n); // ASCENDING SORT reverse(arr,arr+n); //REVERESE ARRAY sort(arr, arr + n, greater<int>());// DESCENDING SORT }
c++ sort array of ints
// C++ program to demonstrate default behaviour of // sort() in STL. #include <bits/stdc++.h> using namespace std; int main() { int arr[] = {1, 5, 8, 9, 6, 7, 3, 4, 2, 0}; int n = sizeof(arr)/sizeof(arr[0]); 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; }
selection sort in java
public static void SelectionSort(int[] arr) { int small; for (int i = 0; i <arr.length - 1; i++) { small = i; for (int j = i + 1; j < arr.length; j++) { //if current position is less than previous smallest if (arr[j] < arr[small]) { small = j; //swap values int temp = arr[i]; arr[i] = arr[small]; arr[small] = temp; } } } }
array sort c++
#include <iostream> 2 #include <array> 3 #include <string> 4 #include <algorithm> 5 6 using namespace std; 7 8 int main(){ 9 array<string, 4> colours = {"blue", "black", "red", "green"}; 10 for (string colour : colours){ 11 cout << colour << ' '; 12 } 13 cout << endl; 14 sort(colours.begin(), colours.end()); 15 for (string colour : colours){ 16 cout << colour << ' '; 17 } 18 return 0; 19 } 66 20 21 /* 22 Output: 23 blue black red green 24 black blue green red 25 */
Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
