Algorithms-K58-PM: Tìm kiếm và Sắp xếp

2 bình luận cho Algorithms-K58-PM: Tìm kiếm và Sắp xếp

• 

  04/10/2020 - 12:09

  Sinh viên  says:

  Thầy có thể gợi ý thêm cách giải bài phương trình bậc 3 bằng binary search không ạ?

  Trả lời
• 

  24/09/2020 - 13:48

  admin  says:

  #include <iostream> #include <algorithm> using namespace std; int main() { int n = 9; int a[] = { 1, 2, 2, 3, 6, 6, 6, 7, 8}; cout << "find(6): " << find(a+0, a+n, 6) - a << endl; cout << "binary_search(5): " << binary_search(a+0, a+n, 5) << endl; cout << "binary_search(6): " << binary_search(a+0, a+n, 6) << endl; cout << "lower_bound(5): " << lower_bound(a+0, a+n, 5) - a << endl; cout << "lower_bound(6): " << lower_bound(a+0, a+n, 6) - a << endl; cout << "upper_bound(5): " << upper_bound(a+0, a+n, 5) - a << endl; cout << "upper_bound(6): " << upper_bound(a+0, a+n, 6) - a << endl; }<pre>

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

  #include <iostream> #include <algorithm> using namespace std;   int main() { int n = 9; int a[] = { 1, 2, 2, 3, 6, 6, 6, 7, 8}; cout << "find(6): " << find(a+0, a+n, 6) - a << endl; cout << "binary_search(5): " << binary_search(a+0, a+n, 5) << endl; cout << "binary_search(6): " << binary_search(a+0, a+n, 6) << endl; cout << "lower_bound(5): " << lower_bound(a+0, a+n, 5) - a << endl; cout << "lower_bound(6): " << lower_bound(a+0, a+n, 6) - a << endl; cout << "upper_bound(5): " << upper_bound(a+0, a+n, 5) - a << endl; cout << "upper_bound(6): " << upper_bound(a+0, a+n, 6) - a << endl; }<pre>

  Trả lời