# 示例1：根据字符串长度排序
words = ['apple', 'banana', 'cherry', 'date']
sorted_words = sorted(words, key=lambda x: len(x))
print(sorted_words)  # 输出: ['date', 'apple', 'banana', 'cherry']

# 示例2：根据元素的绝对值排序
numbers = [-5, 3, -2, 8, -1]
sorted_numbers = sorted(numbers, key=lambda x: abs(x))
print(sorted_numbers)  # 输出: [-1, -2, 3, -5, 8]

// 示例：根据字符串中元音字母的数量排序
const words = ['apple', 'banana', 'cherry', 'date'];
words.sort((a, b) => {
  const countVowels = (s) => s.match(/[aeiou]/gi)?.length || 0;
  return countVowels(a) - countVowels(b);
});
console.log(words); // 输出: ["date", "apple", "cherry", "banana"]

import java.util.Arrays;
import java.util.Comparator;

public class Main {
    public static void main(String[] args) {
        // 示例：根据字符串中数字字符的数量排序
        String[] words = {"a1b2", "no numbers", "123", "a1"};
        
        Arrays.sort(words, Comparator.comparingInt(
            s -> (int) s.chars().filter(Character::isDigit).count()
        ));
        
        System.out.println(Arrays.toString(words));
        // 输出: [no numbers, a1, a1b2, 123]
    }
}

# 原始方法（可能低效）
data = [...]  # 大数据集
sorted_data = sorted(data, key=complex_computation)

# 优化方法
decorated = [(complex_computation(x), x) for x in data]
decorated.sort()
sorted_data = [x for (_, x) in decorated]

# 使用生成器表达式减少内存使用
large_data = [...]  # 非常大的数据集
sorted_data = sorted((complex_computation(x), x) for x in large_data)
sorted_data = [x for (_, x) in sorted_data]