add solution of binary_search

Cargo.toml

@@ -2,9 +2,13 @@
 nursery = { level = "warn", priority = -1 }
 pedantic = { level = "warn", priority = -1 }
 needless_pass_by_value = "allow"
+cast_possible_truncation = "allow"
+cast_possible_wrap = "allow"
+must_use_candidate = "allow"
 
 [workspace]
 members = [
+	"crates/binary_search",
 	"crates/contains_duplicate",
 	"crates/is_palindrome",
 	"crates/two_sum",

crates/binary_search/Cargo.toml

@@ -0,0 +1,9 @@
+[package]
+name = "binary_search"
+version = "0.1.0"
+edition = "2021"
+
+[dependencies]
+
+[lints]
+workspace = true

crates/binary_search/src/lib.rs

@@ -0,0 +1,47 @@
+use std::cmp::Ordering;
+
+pub fn binary_search(nums: Vec<i32>, target: i32) -> i32 {
+	let mut left_pointer = 0;
+	let mut right_pointer = nums.len();
+
+	while left_pointer < right_pointer {
+		let middle = left_pointer + (right_pointer - left_pointer) / 2;
+
+		match target.cmp(&nums[middle]) {
+			Ordering::Equal => return middle as i32,
+			Ordering::Less => right_pointer = middle,
+			Ordering::Greater => left_pointer = middle + 1,
+		}
+	}
+
+	-1
+}
+
+#[cfg(test)]
+mod tests {
+	use super::*;
+
+	#[test]
+	fn case_target_in_middle() {
+		let result = binary_search(vec![1, 3, 5, 7, 9], 5);
+		assert_eq!(result, 2);
+	}
+
+	#[test]
+	fn case_target_in_start() {
+		let result = binary_search(vec![1, 3, 5, 7, 9, 11], 11);
+		assert_eq!(result, 5);
+	}
+
+	#[test]
+	fn case_target_in_end() {
+		let result = binary_search(vec![1, 3, 5, 7, 9], 9);
+		assert_eq!(result, 4);
+	}
+
+	#[test]
+	fn case_not_found() {
+		let result = binary_search(vec![1, 3, 5, 7, 9, 11], 0);
+		assert_eq!(result, -1);
+	}
+}

crates/contains_duplicate/src/lib.rs

@@ -1,6 +1,5 @@
 use std::collections::HashSet;
 
-#[must_use]
 pub fn contains_duplicate(numbers: Vec<i32>) -> bool {
 	let mut set = HashSet::new();
 

crates/is_palindrome/src/lib.rs

@@ -1,4 +1,3 @@
-#[must_use]
 pub fn is_palindrome(s: String) -> bool {
 	if s.trim().is_empty() {
 		return true;

crates/two_sum/src/lib.rs

@@ -1,14 +1,12 @@
 use std::collections::HashMap;
 
-#[must_use]
 pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
 	let mut map = HashMap::new();
 
 	for (i, number) in nums.into_iter().enumerate() {
 		let diff = target - number;
 
 		if let Some(&j) = map.get(&diff) {
-			#[allow(clippy::cast_possible_truncation, clippy::cast_possible_wrap)]
 			return vec![i as i32, j as i32];
 		}
 

crates/valid_anagram/src/lib.rs

@@ -1,6 +1,5 @@
 use std::collections::HashMap;
 
-#[must_use]
 pub fn is_anagram(s: String, t: String) -> bool {
 	if s.len() != t.len() {
 		return false;