b.rekha
i have passed my 10th std in 2000 written directly not through school. how to apply the lost marksheet
what is the new syllabus for 10th std student for academic year 2014-2015
for improvement
10th std
in dpi
How to appear in private for 10th std SSC board
After completing 10th std, one needs to pursue for science stream in class 11 and 12. After that, one can apply for BE/B.Tech in computer science.
You can get 10th std essays of marathi language for board exams at Quikr Mumbai.
Merge sort is considered the most efficient algorithm for sorting lists. #include<iostream> // std::cout, std::endl #include<iomanip> // std::setw #include<list> // std::list #include<random> // Random number generator (RNG) #include<ctime> // C-style time (used by RNG) template<typename T> void merge_lists (std::list<T>& left, std::list<T>& right) { std::list<T> result; while (!left.empty() && !right.empty()) { if (right.front() < left.front()) { result.push_back (right.front()); right.pop_front(); } else { result.push_back (left.front()); left.pop_front(); } } while (!left.empty()) { result.push_back (left.front()); left.pop_front(); } while (!right.empty()) { result.push_back (right.front()); right.pop_front(); } left = std::move (result); } template<typename T> void merge_sort (std::list<T>& list) { // A list of 1 or none is already sorted. if (list.size() < 2) return; // Divide the list into two sublists. const size_t size = list.size() / 2; std::list<T> right; while (size < list.size()) { right.push_front (list.back()); list.pop_back(); } // Recursively sort each sublist. merge_sort (list); merge_sort (right); // Merge the sublists. merge_lists (list, right); } int main () { // Pseudo-random number generator (all 2-digit values). std::default_random_engine generator ((unsigned) time (0)); std::uniform_int_distribution<size_t> distribution (10, 99); // Generate a list of 25 random values (may include duplicates). std::list<size_t> list; while (list.size() != 25) list.push_back (distribution (generator)); // Print the list. std::cout << std::setw (9) << "Unsorted:"; for (auto value : list) std::cout << std::setw (3) << value; std::cout << std::endl; // Sort the list. merge_sort (list); // Print the list. std::cout << std::setw (9) << "Sorted:"; for (auto value : list) std::cout << std::setw (3) << value; std::cout << std::endl; }
Ask your teacher.
NOT YET UPDATED
search in internet.