diff --git a/search/median_search2.cpp b/search/median_search2.cpp
index d2646c313..677935eb9 100644
--- a/search/median_search2.cpp
+++ b/search/median_search2.cpp
@@ -1,5 +1,5 @@
 /**
- * @file median_search2.cpp
+ * @file
  *
  * @details
  * Given a linked list L[0,....,n] of n numbers, find the middle node.