All projects

2025

Project3

We want to optimize Computer Parts Online Store product search performance when sorting a large dataset of products (at least 100,000 products) and c…

Overview

We want to optimize Computer Parts Online Store product search performance when sorting a large dataset of products (at least 100,000 products) and compare two popular sorting algorithms: Heap Sort and Quick Sort. We will see which one is faster and uses less memory. Open-source project by Yeshua Colon, published on GitHub.

Highlights

  • 1 star on GitHub
  • Primary language: C++
  • Open source — view the code and contribute on GitHub

Built with

  • C++

Discussion (0)

Log in to comment.

No comments yet. Be the first to start the conversation.