Skip to content

Update README.md #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
nutankt14 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update README.md #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,2 +1,2 @@
# Quick-Sort
Quick Sort is another example of a divide and conquer algorithm. It requires the identification of an arbitrary pivot point (ideally somewhere near the centre) around which the other values of the array are ordered relatively. This pivot creates a partition in the array. To the left of the pivot we aim to place the values lower than it and to the right the higher values.
Quick Sort is another example of a sorting technique which uses divide and conquer algorithm. It requires the identification of an arbitrary 'pivot' point (ideally somewhere near the centre) around which the other values of the array are ordered relatively. This pivot creates a partition in the array. To the left of the pivot, we aim to place the values which are smaller than it and to the right the larger values.