Skip to content

Update Quick sort.md #100

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
prasanna16-12 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update Quick sort.md #100

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
19 changes: 9 additions & 10 deletions Algorithms/Sorting Algorithms/Quick sort.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -114,7 +114,7 @@ def quickSort(arr, start, end):

Quick Sort can be optimized from O(N) and O(N logN) to O(logN) using tail recursion.It reduces the complexity by solving smallest partition first which improves the time complexity of Quick Sort to O(log N).
### Code `C++`
```
```cpp
void QuickSortOptimized(int arr[],int start,int end){
while(start<end){
int PartitionIndex = partition(arr,start,end); //Getting the Partition index
Expand All @@ -132,18 +132,17 @@ void QuickSortOptimized(int arr[],int start,int end){
}

int partition(int arr[], int start, int end) {
int PartitionIndex = start;
int PartitionValue = arr[end];
int PartitionIndex = start;
int PartitionValue = arr[end];

for (int i = start; i < end; i++) {
if (arr[i] <= PartitionValue) {
swap(arr, i, PartitionIndex++);
}
for (int i = start; i < end; i++) {
if (arr[i] <= PartitionValue) {
swap(arr, i, PartitionIndex++);
}
swap(arr, end, PartitionIndex);
return PartitionIndex;
}

swap(arr, end, PartitionIndex);
return PartitionIndex;
}
```

#### ⏲️ Time Complexities:
Expand Down