Recent studies on EEG-based automated depression detection have primarily depended on complex deep learning models. While these methods improve classification performance, their practical application is limited by high computational complexity, challenging training processes, and poor interpretability. This paper proposes an efficient method for depression recognition, which extracts multi-domain features from preprocessed EEG signals and selects the most discriminative feature subset by integrating the rapid preliminary screening capability of RankSearch with the interactive optimization ability of the Genetic Algorithm (GA). Our approach first eliminates redundant features efficiently through RankSearch, then deeply explores inter-feature relationships via GA, significantly enhancing classification performance while maintaining feature-level interpretability. Using the optimized feature subset, we evaluate performance with multiple machine learning classifiers (Decision Tree, KNN, Random Forest, SVM, XGBoost). Experiments on the public HUSM dataset demonstrate superior performance under rigorous cross-validation (accuracy = 95.08%, sensitivity = 95.99%, specificity = 94.30%, F1-score = 95%, AUC = 0.9514), with feature importance analysis further confirming interpretability. Compared to existing models, our method achieves lower computational complexity and higher clinical practicality, offering a more efficient technical solution for objective depression diagnosis.