vector,binary search,bubble sort and insertion sort

[playersonly31]

i wrote most of the code but every time i run it and press 1 or 2 the program just crashes i don't know why

In C++

Using the vector type as your list, implement functions for each of sequential search, binary search, bubble sort, and insertion sort. You may use function templates, or just force a particular vector type (for example vector).

Create a test program where you add several items to a vector. Use your sequential search function several times to get the index of items, and show when an item is not found. Then use your bubble sort function to sort the vector, and then print out the entire vector to show it is sorted. Now use your binary search function several times to get the index of items, and show when an item is not found. Now add a few more items to the vector, and use insertion sort to sort that, and then print the whole vector to show it is sorted. Alternatively, you could implement a looping test menu that gives options, such as add item, print whole list, use insertion sort, use binary search, etc.

#include <iostream> 
#include <vector>
#include <algorithm>
using namespace std;
int s_search(int s);   // function declarations
void bubblesort();
void b_search();
void insertionsort();
int arr[] = { 3,5,4,2,7,8 };                            // array values to construct vector
vector<int> v(arr, arr + sizeof(arr) / sizeof(arr[0])); // vector initialization

int main() {                                            // main function starts here
	int c = 0, value;                                   // integers for operations
	
	cout << "1.) To sequential search:\n"; 
	cout << "2.) For bubblesort :\n";
	cout << "3.) For binary search:\n";
	cout << "4.) To add values to vector and insertionsort it\n";
	cout << "5.) To exit\n";
	cin >> c;                                                           // reading input number from the user
	while (c != 5) 
	{
		cout << "1.) To sequential search:\n";
		cout << "2.) For bubblesort :\n";
		cout << "3.) For binary_search:\n";
		cout << "4.) To add values to vector and insertionsort it\n";
		cout << "5.) To exit";
		cin >> c;
		switch (c)                                                         // switch to select users option
		{
		case 1: cout << "Enter a value to search:";
			cin >> value;
			s_search(value); break;
		case 2:bubblesort(); break;
		case 3: b_search(); break;
		case 4: cout << "Enter an element to add:\n";
			cin >> value;
			v.push_back(value);
			insertionsort();
			break;
		case 5:cout << "Thank you"; break;
		ddefault: "Done"; break;

		}

	}

	return 0;
}
int s_search(int n) // searching a value sequential search
{
	for (int i = 0; i < v.size(); i++) {
		if (v[i] == n)
			return i;
	}
	return -1;
}
void bubblesort() // bubble sort function
{
	bool swapp = true;
	while (swapp) {
		swapp = false;
		for (int i = 0; i < v.size(); i++) {
			if (v[i]>v[i + 1]) {
				v[i] += v[i + 1];
				v[i + 1] = v[i] - v[i + 1];
				v[i] -= v[i + 1]; // swapping on the comparisiion
				swapp = true;
			}
		}
	}
	for (int i = 0; i <v.size(); i++) {
		cout << v[i] << " "; // printing after sorting

	}
	cout << endl;
}
bool myfunction(int i, int j) { return (i<j); } // temperaroy function to compare

void b_search() // binary search function
{

	// using default comparison:
	std::sort(v.begin(), v.end());

	std::cout << "looking for a 3... ";
	if (std::binary_search(v.begin(), v.end(), 3))
		std::cout << "found!\n"; else std::cout << "not found.\n";

	// using myfunction as comp:
	std::sort(v.begin(), v.end(), myfunction);

	std::cout << "looking for a 6... ";
	if (std::binary_search(v.begin(), v.end(), 6, myfunction))
		std::cout << "found!\n"; else std::cout << "not found.\n";

}
void insertionsort() // function- insertion sort
{
	int i, j, tmp;

	for (i = 1; i < v.size(); i++) {

		j = i;

		while (j > 0 && v[j - 1] > v[j]) {

			tmp = v[j];

			v[j] = v[j - 1];

			v[j - 1] = tmp;

			j--;

		}

	}
	for (int k = 0; k<v.size(); k++)
		cout << v[i];

}

[Thomas1965]

In your function bubblesort you access an element with an invalid index if i is 5.
if (v[i]>v[i + 1])

Why do you show the menu twice?

[playersonly31]

first is to read the output and the second is to select the option should u take one out?