qbarrand
/
dut-suqs
1
0
Fork 0
Code Releases 0 Activity
An academic implementation of the quicksort algorithm in C++.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
14 Commits
1 Branch
948KB
Branch: master
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'master'
${ noResults }
Quentin Barrand 8f9dbb59b3 Updated README.md with up-to-date contact information. 6 years ago
README.md Updated README.md with up-to-date contact information. 6 years ago
Report.pdf Ajout du sujet et du README 8 years ago
Subject.pdf Ajout du sujet et du README 8 years ago
projet.cpp 1er commit de SuQS 8 years ago

README.md

# SuQS A basic QuickSort implementation that alphabetically orders lines of the standard input.

Compilation

Compile simply using GCC : g++ -o projet projet.cpp

Usage

We assume YourTextFile is a simple, UNIX-formatted text file. In the program directory, type cat YourTextFile | ./projet in a terminal to get the YourTextFile file alphabetically ordered.

License

This program is distributed under the terms of the Creative Commons 3.0 BY license

Contact : e-mail | Twitter | Web