U E D R , A S I H C RSS

STL/sort

sort

  • šฐฆฌŠ” ํ”„กœทธžจ ฒจ ฐฐšธ•Œ sort งœŠ”งŽด ํ•œ‹ค. ˆ˜ํ–‰‹œ„ด ฮธ(n*n)ด‚˜ ˜Š” †ŒํŠธ งœณค ํ–ˆ‹ค.
  • STL—„œŠ” Quick Sort •ฝ„ €ํ˜•ํ•œ Sort •Œณ ฆฌฆ˜„  œณตํ•œ‹ค.
  • ˜ˆ œ ณดž.

~cpp 
#include <iostream>
#include <vector>
#include <algorithm>	// sort •Œณ ฆฌฆ˜ “ฐธฐ œ„ํ•œฒƒ
#include <functional>	// less, greater “ฐธฐ œ„ํ•œฒƒ
using namespace std;

typedef vector<int>::iterator VIIT;	

int main()
{
	int ar[10] = {45,12,76,43,75,32,85,32,19,98};	

	vector<int> v(&ar[0], &ar[10]);		

	sort(v.begin(), v.end(), less<int>());	// ˜ค„ฐจˆœ

	for(VIIT it = v.begin() ; it != v.end(); ++it)	
		cout << *it << endl;

	cout << endl;

	sort(v.begin(), v.end(), greater<int>());	// ‚ดฐจˆœ

	for(VIIT it = v.begin() ; it != v.end(); ++it)	
		cout << *it << endl;

	// „‹จํ•˜ฒŒ ˜ค„ฐจˆœ “ธฉด <functional> —†• ณ  sort(v.begin(), v.end()) ํ•˜ฉด œ‹ค.

	return 0;
}
  • STL˜ ดŸฐ ํŽธฆฌํ•จ€ ํ”„กœทธž˜จธ€ žฃŒตฌกฐ งŒ“œŠ • “ฐŠ” ‹œ„„ •Œณ ฆฌฆ˜„ ƒฐํ•˜Š” ‹œ„œกœ Œ ค€‹ค.
  • ํ•œ€€ ˜ํ•  . ด sort•Œณ ฆฌฆ˜€ ปจํ…Œด„ˆ€ ž„˜  ‘(Random Access)„ ํ—ˆšฉํ•œ‹คŠ” € •ํ•˜— งŒ“ ฒƒด‹ค. vector‚˜ dequeฒ˜Ÿ ž„˜  ‘„ ํ—ˆšฉํ•˜Š” ปจํ…Œด„ˆŠ” ด“ธˆ˜ žˆ€งŒ. listŠ” ž„˜  ‘ด ถˆ€Šฅํ•ด„œ ‚ฌšฉํ• ˆ˜ —†‹ค. -l5 ดŸฐ  ‘ด •ˆœ‹คŠ” ˜ธ - ”ฐ„œ list—„œŠ” ปจํ…Œด„ˆ ‚ด€—„œ sortฉ”†Œ“œ  œณตํ•ด €‹ค.
----
STL
Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:27:58
Processing time 0.0143 sec