Skip to content

quicksort， cpp version #558

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

Closed
wants to merge 1 commit into from
Closed

quicksort， cpp version #558

Show file tree
Hide file tree
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
80 changes: 80 additions & 0 deletions basic/sorting/QuickSort/Main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,80 @@
#include <iostream>
#include <vector>

using namespace std;
void printvec( const vector<int> &vec, const string &strbegin = "", const string &strend = "" )
{
cout << strbegin << endl;
for ( auto val : vec )
{
cout << val << "\t";
}

cout << endl;
cout << strend << endl;
}


int partition( vector<int> & vec, int left, int right )
{
if ( left >= right )
{
return left;
}

int base = vec[left];
while ( left < right )
{
while ( left < right && vec[right] >= base )
{
right--;
}
if ( left >= right )
{
break;
}

vec[left] = vec[right];

while ( left < right && vec[left] <= base )
{
left++;
}

if ( left >= right )
{
break;
}

vec[right] = vec[left];
}

vec[left] = base;
return left;
}


void quicksort( vector<int> & vec, int left, int right )
{
if ( left >= right )
{
return;
}

int idx = partition( vec, left, right );
quicksort( vec, left, idx - 1 );
quicksort( vec, idx + 1, right );
}


int main( void )
{
vector<int> vec = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
printvec( vec );
quicksort( vec, 0, vec.size() - 1 );
printvec( vec, "after insert sort" );
return 0;
}



83 changes: 83 additions & 0 deletions basic/sorting/QuickSort/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -288,4 +288,87 @@ fn main() -> io::Result<()> {
}
```



**C++**

```c++
Copy link
Member

@yanglbme yanglbme Sep 13, 2021

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
```c++
```cpp

Copy link
Author

@rongliang666 rongliang666 Sep 14, 2021

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

修改后重新pr，这个老的是关闭，貌似我没权限操作老的?

#include <iostream>
#include <vector>

using namespace std;
void printvec( const vector<int> &vec, const string &strbegin = "", const string &strend = "" )
{
cout << strbegin << endl;
for ( auto val : vec )
{
cout << val << "\t";
}

cout << endl;
cout << strend << endl;
}


int partition( vector<int> & vec, int left, int right )
{
if ( left >= right )
{
return left;
}

int base = vec[left];
while ( left < right )
{
while ( left < right && vec[right] >= base )
{
right--;
}
if ( left >= right )
{
break;
}

vec[left] = vec[right];

while ( left < right && vec[left] <= base )
{
left++;
}

if ( left >= right )
{
break;
}

vec[right] = vec[left];
}

vec[left] = base;
return left;
}


void quicksort( vector<int> & vec, int left, int right )
{
if ( left >= right )
{
return;
}

int idx = partition( vec, left, right );
quicksort( vec, left, idx - 1 );
quicksort( vec, idx + 1, right );
}


int main( void )
{
vector<int> vec = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
printvec( vec );
quicksort( vec, 0, vec.size() - 1 );
printvec( vec, "after insert sort" );
return 0;
}
```
<!-- tabs:end -->