#include <iostream> #include <algorithm> int main() { int array[] = { 23, 5, -10, 0, 0, 321, 1, 2, 99, 30 }; int elements = sizeof(array) / sizeof(array[0]); std::sort(array, array + elements); for (int i = 0; i < elements; ++i) std::cout << array[i] << ' '; } //The same functionality using vector container: #include <iostream> #include <algorithm> #include <vector> int main() { std::vector<int> vec {10, 5, 100}; std::sort(vec.begin(), vec.end()); for (int i = 0; i < vec.size(); ++i) std::cout << vec[i] << ' '; }
Wednesday, 24 June 2015
Sort an array without algorithm
Labels:
Algorithm
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment