Function upper_bound 

pub fn upper_bound<T: Ord>(list: &[T], target: &T) -> usize

Birinchi > target elementning indeksi (C++ dagi upper_bound).

upper_bound - lower_bound = target necha marta uchraganini beradi (O(log n) da!).

Misol

use rust_algorithms::searching::{lower_bound, upper_bound};

let v = [1, 2, 2, 2, 5];
assert_eq!(upper_bound(&v, &2), 4);
let nechta = upper_bound(&v, &2) - lower_bound(&v, &2);
assert_eq!(nechta, 3);