使用js中的递归函数按扩展名排序文件

const fs = require('fs');

function getFiles(dirPath, fileList) {
  const files = fs.readdirSync(dirPath);

  files.forEach((file) => {
    const filePath = `${dirPath}/${file}`;
    const stats = fs.statSync(filePath);

    if (stats.isDirectory()) {
      getFiles(filePath, fileList);
    } else {
      fileList.push(filePath);
    }
  });

  return fileList;
}

const files = getFiles('path/to/directory', []);

function sortByExtension(files) {
  if (files.length <= 1) {
    return files;
  }

  const pivotIndex = Math.floor(files.length / 2);
  const pivot = files[pivotIndex];
  const left = [];
  const right = [];

  files.forEach((file, index) => {
    if (index === pivotIndex) {
      return;
    }

    if (file.split('.').pop() <= pivot.split('.').pop()) {
      left.push(file);
    } else {
      right.push(file);
    }
  });

  return sortByExtension(left).concat([pivot], sortByExtension(right));
}

const sortedFiles = sortByExtension(files);

sortedFiles.forEach((file) => {
  console.log(file);
});