Show HN: VSort: Advanced Sorting Algorithm Optimized for Apple Silicon

You keep posting projects, and your comments almost never engage with the substance of the response or criticism you receive. Many of your comments have the flavor of LLM-generated text. The FAQ you added to this repo in response to the question you received is obviously LLM generated.

> Please don't use HN primarily for promotion. It's ok to post your own stuff part of the time, but the primary use of the site should be for curiosity.

https://news.ycombinator.com/newsguidelines.html

You're using HN for promotion, and showing no apparent curiosity. You're misusing HN.

How do I interpret the benchmark results showing that it's slower than mergesort? Is that using the very simple implementation in vsort/examples /benchmark.c? Being slower than that while using SIMD and multicore isn't appealing.

VSort is a high-performance sorting library that leverages the unique architecture of Apple Silicon processors to deliver exceptional performance. By intelligently utilizing ARM NEON vector instructions, Grand Central Dispatch, and the heterogeneous core design of M-series chips, VSort achieves remarkable efficiency particularly for partially sorted data collections.

VSort represents an advanced sorting solution for Apple Silicon, combining ARM NEON, GCD, heterogeneous core management, and adaptive algorithms. Its performance is competitive, with significant improvements for partially sorted or large datasets, making it suitable for high-performance computing tasks on macOS.