Delete save from folder function
•Download as DOCX, PDF•
0 likes•112 views
This function deletes a save file from the save folder. It first checks which tab is currently selected (incomplete or complete saves) and if a save is actually selected. It then constructs the file path of the selected save and deletes it, before removing the save from the appropriate save list.
Report
Share
Report
Share
![// this function was used to delete a save from the 'save' folder
void GameSaveState::DeleteSelection()
{
int currTab = tabWindow->GetCurrTab();
if (currTab == 0 && (incompleteSave.empty() || selectionIndex >=
(int)incompleteSave.size())) return;
if (currTab == 1 && (completeSave.empty() || selectionIndex >=
(int)completeSave.size())) return;
int result;
if (currTab == 0)
{
wostringstream currFile;
currFile << incompleteSave[selectionIndex].address.c_str();
result = DeleteFile(wstring(currFile.str()).c_str());
incompleteSave.erase(incompleteSave.begin() + selectionIndex);
}
else
{
wostringstream currFile;
currFile << completeSave[selectionIndex].address.c_str();
result = DeleteFile(wstring(currFile.str()).c_str());
completeSave.erase(completeSave.begin() + selectionIndex);
}
if (0 == result)
DWORD err = GetLastError();
}](https://image.slidesharecdn.com/deletesavefromfolderfunction-151024112857-lva1-app6891/85/Delete-save-from-folder-function-1-320.jpg)
Recommended
Data Purge Algorithm
Presentation on the process for deleting humongous data from a DB2 LUW database.
Designing Immutability Data Flows in Ember
Presented at EmberFest 2017, Berlin. The talk walks through possible patterns to implement immutability within Data Down, Actions Up and its benefits.
Get the Most Out of iOS 11 with Visual Studio Tools for Xamarin
In this webinar deck Craig Dunn shows what’s new in iOS 11 and how to take advantage of the latest updates – from drag-and-drop for iPad to machine learning and more – 100% in .NET and Visual Studio. Whether you’re building new or updating existing Xamarin.iOS apps, you’ll see how to implement new frameworks, APIs, and UI features, walk-through code samples, get expert tips and tricks, so you can start shipping iOS 11-ready apps to your users.
Watch webinar at https://youtu.be/mXAbpXLT1vo
Recommended
Data Purge Algorithm
Presentation on the process for deleting humongous data from a DB2 LUW database.
Designing Immutability Data Flows in Ember
Presented at EmberFest 2017, Berlin. The talk walks through possible patterns to implement immutability within Data Down, Actions Up and its benefits.
Get the Most Out of iOS 11 with Visual Studio Tools for Xamarin
In this webinar deck Craig Dunn shows what’s new in iOS 11 and how to take advantage of the latest updates – from drag-and-drop for iPad to machine learning and more – 100% in .NET and Visual Studio. Whether you’re building new or updating existing Xamarin.iOS apps, you’ll see how to implement new frameworks, APIs, and UI features, walk-through code samples, get expert tips and tricks, so you can start shipping iOS 11-ready apps to your users.
Watch webinar at https://youtu.be/mXAbpXLT1vo
Composition in JavaScript
The value of composition and simple functional programming techniques in JavaScript and more!
Windows Server 2012 Active Directory Recovery
Bu web seminerinde geçmişden günümüze Active Directory Recovery methodları anlatılıp, uygulamalar yapılacaktır.
Node.js middleware: Never again!
Video: https://youtu.be/RS8x73z4csI
What is middleware?
Mixins, Reference pollution and shared state, Race condition and Abstraction leaks, Fat controller and layers mix, High coupling and Error ignoring
Node.js in 2020 - part 2
Видео: https://youtu.be/r1u-dGocm1c
План 2-го вебинара: Обзор распространенных проблем: утечки памяти и ресурсов, игнорирование ошибок и потенциальных мест их появления, нарушение принципов GRASP и SOLID в Node.js, понятия связанности и зацепления программных компонентов, применение GoF паттернов и других шаблонов проектирования, обзор антипаттернов в Node.js и как это должно влиять на написание ежедневного кода.
Prototype programming in JavaScript
Author: Timur Shemsedinov
Video: https://youtu.be/SzaXTW2qcJE
Code examples: https://github.com/HowProgrammingWorks/PrototypeChain
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
부천오피 목동오피 선릉오피 강남역오피걸 무료성인자료
밤문화 정보 인증절차없이 무료회원가입☆☆다솜넷☆☆주소창 http://dasom10.net ☆☆☆ 부천오피 목동오피 선릉오피 강남역오피 ▷▷다솜넷 오피 오피걸 오피방 안마 건마 휴게텔 립 핸 풀 국내야동 성인자료등 무료다운☆☆☆
인천오피 서현오피 공덕오피 일산오피걸 무료성인자료
밤문화 정보 인증절차없이 무료회원가입☆☆다솜넷☆☆주소창 http://dasom10.net ☆☆☆ 인천오피 서현오피 공덕오피 일산오피 ▷▷다솜넷 오피 오피걸 오피방 안마 건마 휴게텔 립 핸 풀 국내야동 성인자료등 무료다운☆☆☆
분당건마 선릉건마 《역삼오피》선불&대포폰/ 분당건마
밤문화 정보 인증절차없이 무료회원가입☆☆다솜넷☆☆주소창 http://dasom10.net ☆☆☆ 분당건마 선릉건마 역삼오피 분당건마 ▷▷다솜넷 오피 오피걸 오피방 안마 건마 휴게텔 립 핸 풀 국내야동 성인자료등 무료다운☆☆☆
More Related Content
What's hot
Composition in JavaScript
The value of composition and simple functional programming techniques in JavaScript and more!
Windows Server 2012 Active Directory Recovery
Bu web seminerinde geçmişden günümüze Active Directory Recovery methodları anlatılıp, uygulamalar yapılacaktır.
Node.js middleware: Never again!
Video: https://youtu.be/RS8x73z4csI
What is middleware?
Mixins, Reference pollution and shared state, Race condition and Abstraction leaks, Fat controller and layers mix, High coupling and Error ignoring
Node.js in 2020 - part 2
Видео: https://youtu.be/r1u-dGocm1c
План 2-го вебинара: Обзор распространенных проблем: утечки памяти и ресурсов, игнорирование ошибок и потенциальных мест их появления, нарушение принципов GRASP и SOLID в Node.js, понятия связанности и зацепления программных компонентов, применение GoF паттернов и других шаблонов проектирования, обзор антипаттернов в Node.js и как это должно влиять на написание ежедневного кода.
Prototype programming in JavaScript
Author: Timur Shemsedinov
Video: https://youtu.be/SzaXTW2qcJE
Code examples: https://github.com/HowProgrammingWorks/PrototypeChain
What's hot (14)
R (Shiny Package) - UI Side Script for Decision Support System
R (Shiny Package) - UI Side Script for Decision Support System
Viewers also liked
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
해외야구픽《∼∼》ｐｕpu82，cＯm《∼∼》 홀짝게임 홀짝배팅
부천오피 목동오피 선릉오피 강남역오피걸 무료성인자료
밤문화 정보 인증절차없이 무료회원가입☆☆다솜넷☆☆주소창 http://dasom10.net ☆☆☆ 부천오피 목동오피 선릉오피 강남역오피 ▷▷다솜넷 오피 오피걸 오피방 안마 건마 휴게텔 립 핸 풀 국내야동 성인자료등 무료다운☆☆☆
인천오피 서현오피 공덕오피 일산오피걸 무료성인자료
밤문화 정보 인증절차없이 무료회원가입☆☆다솜넷☆☆주소창 http://dasom10.net ☆☆☆ 인천오피 서현오피 공덕오피 일산오피 ▷▷다솜넷 오피 오피걸 오피방 안마 건마 휴게텔 립 핸 풀 국내야동 성인자료등 무료다운☆☆☆
분당건마 선릉건마 《역삼오피》선불&대포폰/ 분당건마
밤문화 정보 인증절차없이 무료회원가입☆☆다솜넷☆☆주소창 http://dasom10.net ☆☆☆ 분당건마 선릉건마 역삼오피 분당건마 ▷▷다솜넷 오피 오피걸 오피방 안마 건마 휴게텔 립 핸 풀 국내야동 성인자료등 무료다운☆☆☆
동탄건마 청주건마 《청주오피》선불&대포폰/ 선릉역건마
밤문화 정보 인증절차없이 무료회원가입☆☆다솜넷☆☆주소창 http://dasom10.net ☆☆☆ 동탄건마 청주건마 청주오피 선릉역건마 ▷▷다솜넷 오피 오피걸 오피방 안마 건마 휴게텔 립 핸 풀 국내야동 성인자료등 무료다운☆☆☆
Basic Statistics to start Analytics
Presentation cover the topics related to basis stats that are very useful to start you initial data analysis.
Jurnal dwi wahyu
SIMULASI BORDER GATEWAY PROTOCOL (BGP) UNTUK LAYANAN PAKET DATA MENGGUNAKAN SIMULATOR GNS3
Viewers also liked (16)
Lớp huấn luyện giảng viên an toàn lao động tại TPHCM
Lớp huấn luyện giảng viên an toàn lao động tại TPHCM
Similar to Delete save from folder function
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th..
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
#include algorithm #include vector #include iostream usi.pdf
#include
#include
#include
using namespace std;
template //For Template
void bogosort(std::vector& array) //For bogosort
{
while (! is_sorted(array))
{
std::random_shuffle(array.begin(), array.end());
}
}
template
bool is_sorted(const std::vector& array) //Conforming for display
{
for (typename std::vector::size_type i = 1; i < array.size(); ++i)
{
if (array[i] < array[i-1])
{
return false;
}
}
return true;
}
std::vector a (10); //Creates a vector of size 10
int arr[10];
template
void accept(std::vector& array) //Accepts data to a vector
{
int c;
for(c = 0; c < 10; c++)
cin>>arr[c];
a.assign (arr,arr+10); //Assign array data to the vector
}
template
void display(std::vector& array) //Display the vector contents
{
for (std::vector::iterator it = array.begin(); it != array.end(); ++it)
std::cout << \' \' << *it;
}
template
void selection(std::vector& arr) //Selection soring operation
{
int mini, loc, temp, x, y;
mini = arr[0];
for(x = 0; x <= arr.size()-1; x++)
{
mini = arr[x]; //x position value of array is considered as minimum value
loc = x; //Stores the location of the minimum value
for(y = x + 1; y <= arr.size()-1; y++)
{
if(arr[y] < mini) //Checks the already minimum value with the array contents
{
mini = arr[y]; //Stores the new minimum value
loc = y; //Stores the location of the minimum value
}
}
if(loc != x) //If it is not the same location
{
temp = arr[x];
arr[x] = arr[loc];
arr[loc] = temp;
}
}
}
template
void bubble(std::vector &ar) //Bubble sort operation
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < ar.size()-1; i++)
{
if (ar[i]>ar[i+1] )
{
ar[i] += ar[i+1];
ar[i+1] = ar[i] - ar[i+1];
ar[i] -=ar[i+1];
swapp = true;
}
}
}
}
int main()
{
char ch;
do
{
cout<<\"\ MENU\";
cout<<\"\ a Fill the array with user input\";
cout<<\"\ b Display the array\";
cout<<\"\ c Suffel the array element randomly\";
cout<<\"\ d Sort the array using bubble sort\";
cout<<\"\ e Sort the array using Selection Sort\";
cout<<\"\ f Exit Program\";
cout<<\"\ Enter your choice: \";
cin>>ch;
switch(ch)
{
case \'a\':
case \'A\':
accept(a);
cout<<\"\ Accept data operation completed \ \";
break;
case \'b\':
case \'B\':
display(a);
cout<<\"\ Display data operation completed \ \";
break;
case \'c\':
case \'C\':
bogosort(a);
bool b = is_sorted(a);
if(b == true)
display(a);
cout<<\"\ Bugg Sorting operation completed \ \";
break;
case \'d\':
case \'D\':
bubble(a);
display(a);
cout<<\"\ Bubble Sort operation completed \ \";
break;
case \'e\':
case \'E\':
selection(a);
display(a);
cout<<\"\ Selection Sort operation completed \ \";
break;
case \'f\':
case \'F\':
exit(0);
default:
cout<<\"\ Wrong Choice\";
}
}while(1); //Loop will continue infinitely till F or f is pressed
}
Output
MENU
a Fill the array with user input
b Display the array
c Suffel the array element randomly
d Sort the array using bubble sort
e Sort the array using Selection Sort
f Exit Program
Enter your choice: a
10
5
4
78
9
65
3
1
45
66
Accept data operation completed
MENU
a Fill th.
Similar to Delete save from folder function (20)
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
#include algorithm #include vector #include iostream usi.pdf
More from George Scott IV
Square selection function
this function is used for 2 purposes. Both are determined based on the current actionStatus
1) selecting a unit
2) moving or declaring an attack with the selected unit
More from George Scott IV (7)
Recently uploaded
GraphSummit Paris - The art of the possible with Graph Technology
Sudhir Hasbe, Chief Product Officer, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
Enterprise Resource Planning System in Telangana
Enterprise Resource Planning System includes various modules that reduce any business's workload. Additionally, it organizes the workflows, which drives towards enhancing productivity. Here are a detailed explanation of the ERP modules. Going through the points will help you understand how the software is changing the work dynamics.
To know more details here: https://blogs.nyggs.com/nyggs/enterprise-resource-planning-erp-system-modules/
AI Pilot Review: The World’s First Virtual Assistant Marketing Suite
AI Pilot Review: The World’s First Virtual Assistant Marketing Suite
👉👉 Click Here To Get More Info 👇👇
https://sumonreview.com/ai-pilot-review/
AI Pilot Review: Key Features
✅Deploy AI expert bots in Any Niche With Just A Click
✅With one keyword, generate complete funnels, websites, landing pages, and more.
✅More than 85 AI features are included in the AI pilot.
✅No setup or configuration; use your voice (like Siri) to do whatever you want.
✅You Can Use AI Pilot To Create your version of AI Pilot And Charge People For It…
✅ZERO Manual Work With AI Pilot. Never write, Design, Or Code Again.
✅ZERO Limits On Features Or Usages
✅Use Our AI-powered Traffic To Get Hundreds Of Customers
✅No Complicated Setup: Get Up And Running In 2 Minutes
✅99.99% Up-Time Guaranteed
✅30 Days Money-Back Guarantee
✅ZERO Upfront Cost
See My Other Reviews Article:
(1) TubeTrivia AI Review: https://sumonreview.com/tubetrivia-ai-review
(2) SocioWave Review: https://sumonreview.com/sociowave-review
(3) AI Partner & Profit Review: https://sumonreview.com/ai-partner-profit-review
(4) AI Ebook Suite Review: https://sumonreview.com/ai-ebook-suite-review
Providing Globus Services to Users of JASMIN for Environmental Data Analysis
JASMIN is the UK’s high-performance data analysis platform for environmental science, operated by STFC on behalf of the UK Natural Environment Research Council (NERC). In addition to its role in hosting the CEDA Archive (NERC’s long-term repository for climate, atmospheric science & Earth observation data in the UK), JASMIN provides a collaborative platform to a community of around 2,000 scientists in the UK and beyond, providing nearly 400 environmental science projects with working space, compute resources and tools to facilitate their work. High-performance data transfer into and out of JASMIN has always been a key feature, with many scientists bringing model outputs from supercomputers elsewhere in the UK, to analyse against observational or other model data in the CEDA Archive. A growing number of JASMIN users are now realising the benefits of using the Globus service to provide reliable and efficient data movement and other tasks in this and other contexts. Further use cases involve long-distance (intercontinental) transfers to and from JASMIN, and collecting results from a mobile atmospheric radar system, pushing data to JASMIN via a lightweight Globus deployment. We provide details of how Globus fits into our current infrastructure, our experience of the recent migration to GCSv5.4, and of our interest in developing use of the wider ecosystem of Globus services for the benefit of our user community.
First Steps with Globus Compute Multi-User Endpoints
In this presentation we will share our experiences around getting started with the Globus Compute multi-user endpoint. Working with the Pharmacology group at the University of Auckland, we have previously written an application using Globus Compute that can offload computationally expensive steps in the researcher's workflows, which they wish to manage from their familiar Windows environments, onto the NeSI (New Zealand eScience Infrastructure) cluster. Some of the challenges we have encountered were that each researcher had to set up and manage their own single-user globus compute endpoint and that the workloads had varying resource requirements (CPUs, memory and wall time) between different runs. We hope that the multi-user endpoint will help to address these challenges and share an update on our progress here.
Enterprise Software Development with No Code Solutions.pptx
In the ever-evolving landscape of technology, enterprise software development is undergoing a significant transformation. Traditional coding methods are being challenged by innovative no-code solutions, which promise to streamline and democratize the software development process.
This shift is particularly impactful for enterprises, which require robust, scalable, and efficient software to manage their operations. In this article, we will explore the various facets of enterprise software development with no-code solutions, examining their benefits, challenges, and the future potential they hold.
2024 RoOUG Security model for the cloud.pptx
How we've evolved the MySQL server security model from a single DBA to the cloud.
Enhancing Research Orchestration Capabilities at ORNL.pdf
Cross-facility research orchestration comes with ever-changing constraints regarding the availability and suitability of various compute and data resources. In short, a flexible data and processing fabric is needed to enable the dynamic redirection of data and compute tasks throughout the lifecycle of an experiment. In this talk, we illustrate how we easily leveraged Globus services to instrument the ACE research testbed at the Oak Ridge Leadership Computing Facility with flexible data and task orchestration capabilities.
In 2015, I used to write extensions for Joomla, WordPress, phpBB3, etc and I ...
In 2015, I used to write extensions for Joomla, WordPress, phpBB3, etc and I didn't get rich from it but it did have 63K downloads (powered possible tens of thousands of websites).
Cyaniclab : Software Development Agency Portfolio.pdf
CyanicLab, an offshore custom software development company based in Sweden,India, Finland, is your go-to partner for startup development and innovative web design solutions. Our expert team specializes in crafting cutting-edge software tailored to meet the unique needs of startups and established enterprises alike. From conceptualization to execution, we offer comprehensive services including web and mobile app development, UI/UX design, and ongoing software maintenance. Ready to elevate your business? Contact CyanicLab today and let us propel your vision to success with our top-notch IT solutions.
Gamify Your Mind; The Secret Sauce to Delivering Success, Continuously Improv...
Games are powerful teaching tools, fostering hands-on engagement and fun. But they require careful consideration to succeed. Join me to explore factors in running and selecting games, ensuring they serve as effective teaching tools. Learn to maintain focus on learning objectives while playing, and how to measure the ROI of gaming in education. Discover strategies for pitching gaming to leadership. This session offers insights, tips, and examples for coaches, team leads, and enterprise leaders seeking to teach from simple to complex concepts.
Globus Compute wth IRI Workflows - GlobusWorld 2024
As part of the DOE Integrated Research Infrastructure (IRI) program, NERSC at Lawrence Berkeley National Lab and ALCF at Argonne National Lab are working closely with General Atomics on accelerating the computing requirements of the DIII-D experiment. As part of the work the team is investigating ways to speedup the time to solution for many different parts of the DIII-D workflow including how they run jobs on HPC systems. One of these routes is looking at Globus Compute as a way to replace the current method for managing tasks and we describe a brief proof of concept showing how Globus Compute could help to schedule jobs and be a tool to connect compute at different facilities.
Beyond Event Sourcing - Embracing CRUD for Wix Platform - Java.IL
In software engineering, the right architecture is essential for robust, scalable platforms. Wix has undergone a pivotal shift from event sourcing to a CRUD-based model for its microservices. This talk will chart the course of this pivotal journey.
Event sourcing, which records state changes as immutable events, provided robust auditing and "time travel" debugging for Wix Stores' microservices. Despite its benefits, the complexity it introduced in state management slowed development. Wix responded by adopting a simpler, unified CRUD model. This talk will explore the challenges of event sourcing and the advantages of Wix's new "CRUD on steroids" approach, which streamlines API integration and domain event management while preserving data integrity and system resilience.
Participants will gain valuable insights into Wix's strategies for ensuring atomicity in database updates and event production, as well as caching, materialization, and performance optimization techniques within a distributed system.
Join us to discover how Wix has mastered the art of balancing simplicity and extensibility, and learn how the re-adoption of the modest CRUD has turbocharged their development velocity, resilience, and scalability in a high-growth environment.
OpenFOAM solver for Helmholtz equation, helmholtzFoam / helmholtzBubbleFoam
In this slide, we show the simulation example and the way to compile this solver.
In this solver, the Helmholtz equation can be solved by helmholtzFoam. Also, the Helmholtz equation with uniformly dispersed bubbles can be simulated by helmholtzBubbleFoam.
May Marketo Masterclass, London MUG May 22 2024.pdf
Can't make Adobe Summit in Vegas? No sweat because the EMEA Marketo Engage Champions are coming to London to share their Summit sessions, insights and more!
This is a MUG with a twist you don't want to miss.
Top Features to Include in Your Winzo Clone App for Business Growth (4).pptx
Discover the essential features to incorporate in your Winzo clone app to boost business growth, enhance user engagement, and drive revenue. Learn how to create a compelling gaming experience that stands out in the competitive market.
Navigating the Metaverse: A Journey into Virtual Evolution"
Join us for an exploration of the Metaverse's evolution, where innovation meets imagination. Discover new dimensions of virtual events, engage with thought-provoking discussions, and witness the transformative power of digital realms."
APIs for Browser Automation (MoT Meetup 2024)
APIs for Browser Automation:
Selenium, Cypress, Puppeteer, and Playwright. Ministry of Testing Athens. Meetup on the Beach. 30 May 2024.
Recently uploaded (20)
GraphSummit Paris - The art of the possible with Graph Technology
GraphSummit Paris - The art of the possible with Graph Technology
AI Pilot Review: The World’s First Virtual Assistant Marketing Suite
AI Pilot Review: The World’s First Virtual Assistant Marketing Suite
Providing Globus Services to Users of JASMIN for Environmental Data Analysis
Providing Globus Services to Users of JASMIN for Environmental Data Analysis
First Steps with Globus Compute Multi-User Endpoints
First Steps with Globus Compute Multi-User Endpoints
Enterprise Software Development with No Code Solutions.pptx
Enterprise Software Development with No Code Solutions.pptx
Enhancing Research Orchestration Capabilities at ORNL.pdf
Enhancing Research Orchestration Capabilities at ORNL.pdf
In 2015, I used to write extensions for Joomla, WordPress, phpBB3, etc and I ...
In 2015, I used to write extensions for Joomla, WordPress, phpBB3, etc and I ...
Cyaniclab : Software Development Agency Portfolio.pdf
Cyaniclab : Software Development Agency Portfolio.pdf
Gamify Your Mind; The Secret Sauce to Delivering Success, Continuously Improv...
Gamify Your Mind; The Secret Sauce to Delivering Success, Continuously Improv...
Globus Compute wth IRI Workflows - GlobusWorld 2024
Globus Compute wth IRI Workflows - GlobusWorld 2024
Beyond Event Sourcing - Embracing CRUD for Wix Platform - Java.IL
Beyond Event Sourcing - Embracing CRUD for Wix Platform - Java.IL
OpenFOAM solver for Helmholtz equation, helmholtzFoam / helmholtzBubbleFoam
OpenFOAM solver for Helmholtz equation, helmholtzFoam / helmholtzBubbleFoam
May Marketo Masterclass, London MUG May 22 2024.pdf
May Marketo Masterclass, London MUG May 22 2024.pdf
Top Features to Include in Your Winzo Clone App for Business Growth (4).pptx
Top Features to Include in Your Winzo Clone App for Business Growth (4).pptx
Navigating the Metaverse: A Journey into Virtual Evolution"
Navigating the Metaverse: A Journey into Virtual Evolution"
Delete save from folder function
- 1. // this function was used to delete a save from the 'save' folder void GameSaveState::DeleteSelection() { int currTab = tabWindow->GetCurrTab(); if (currTab == 0 && (incompleteSave.empty() || selectionIndex >= (int)incompleteSave.size())) return; if (currTab == 1 && (completeSave.empty() || selectionIndex >= (int)completeSave.size())) return; int result; if (currTab == 0) { wostringstream currFile; currFile << incompleteSave[selectionIndex].address.c_str(); result = DeleteFile(wstring(currFile.str()).c_str()); incompleteSave.erase(incompleteSave.begin() + selectionIndex); } else { wostringstream currFile; currFile << completeSave[selectionIndex].address.c_str(); result = DeleteFile(wstring(currFile.str()).c_str()); completeSave.erase(completeSave.begin() + selectionIndex); } if (0 == result) DWORD err = GetLastError(); }