0
size 619
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
Can you sue husband for STD?
Whether or not you can sue your husband for an STD depends greatly on where you live. If you get an STD from your spouse, you can sue for negligence, emotional distress, battery, and breach of contract.
How do you write a c plus plus program to print a hollow square of a given size using asterisks and blanks?
void draw_box (const unsigned size) { if (!size) return; // size must be non-zero! const char star {'*'}; // asterisk const char nl {'\n'}; // newline if (size==1) { // a box of size 1 is just a single asterisk std::cout << star << nl; return; } // else if (1 < size) ... // the top and bottom lines are the same const std::string line (size, star); // hollow line (spaces) const std::string hollow (size-2, ' '); // draw the top line std::cout << line << nl; // draw the middle lines (if size>2) for (unsigned i=2; i<size; ++i) std::cout << star << hollow << star << nl; // draw the bottom line std::cout << line << nl; }
Menu driven program for selection sort bubble sort and insertion sort in c?
#include<iostream> #include<time.h> #include<iomanip> #include<string> void swap(int& x, int& y) { x^=y^=x^=y; } void bubble_sort(int* A, int size) { while(size) { int n=0; for(int i=1; i<size; ++i) { if(A[i-1]>A[i]) { swap(A[i-1], A[i]); n=i; } } size=n; } } void insertion_sort(int* A, int size) { for(int i=1; i<size; ++i) { int value=A[i]; int hole=i; while( hole && value<A[hole-1] ) { A[hole]=A[hole-1]; --hole; } A[hole]=value; } } void selection_sort(int* A, int size) { for(int i=0; i<size-1; ++i) { int j=i; for(int k=i+1; k<size; ++k) if(A[k]<A[j]) j=k; if( i!=j ) swap(A[i],A[j]); } } void sort(int* A, int size, int sort_type) { switch(sort_type) { case(0): bubble_sort( A, size ); case(1): insertion_sort( A, size ); case(2): selection_sort( A, size ); } } int* copy_array(int* A, int size) { int* copy=new int[size]; memcpy(copy, A, size*sizeof(int)); return(copy); } void print_array(int* A, int size, char* prompt) { std::cout<<prompt<<"\t"; for(int i=0; i<size; ++i) std::cout<<std::setw(2)<<A[i]<<" "; std::cout<<std::endl; } int get_rand(int range_min=0, int range_max=RAND_MAX) { return((int) ((double)rand() / (RAND_MAX + 1) * ((range_max + 1) - range_min) + range_min)); } int input_char(std::string prompt, std::string input) { char ch; do { std::cout<<prompt<<": "; std::cin>>ch; } while(input.find(ch)==std::string::npos); return(input.find(ch)%(input.size()/2)); } int main() { srand((unsigned) time(NULL)); int size = get_rand( 10, 80); if( int* A = new int[size] ) { for( int i=0; i<size; ++i ) A[i]=get_rand( 1, size ); int choice=input_char("Please select a sorting method:\n[B]ubble, [I]nsert, [S]election", "bisBIS"); std::cout<<"You chose "; switch(choice) { case(0): std::cout<<"bubble"; break; case(1): std::cout<<"insertion"; break; case(2): std::cout<<"selection"; break; } std::cout<<" sort...\n"<<std::endl; print_array( A, size, "Before sorting" ); sort(A, size, choice); print_array( A, size, "After sorting" ); delete [] A; } return(0); }
How big is the dress size STD?
It means Standard, which is basically a one-size-fits-all kinda thing.
What size alternator does a Ford F-250 have?
95 amp STD , 130amp optional
HOW to write a c plus plus program to display 100 students first name last name id age?
The following program will read student data from stdin and print the data to stdout. #include<iostream> #include<string> struct student_t { std::string first_name; std::string last_name; std::string id; unsigned int age; }; std::istream& operator>>(std::istream& is, student_t& student) { is>>student.first_name; is>>student.last_name; is>>student.id; is>>student.age; return(is); } std::ostream& operator<<(std::ostream& os, const student_t& student) { os<<student.first_name.c_str()<<' ' <<student.last_name.c_str()<<' ' <<student.id.c_str()<<' '<< student.age; return(os); } void input(student_t student[], size_t size) { for(int i=0; i<size; ++i) std::cin>>student[i]; } void output(student_t student[], size_t size) { for(int i=0; i<size; ++i) std::cout<<student[i]; } int main() { student_t student[100]; input(student, 100); output(student, 100); }
How do you convert a floating decimal to binary in C plus plus?
#include<iostream> #include<string> #include<limits> #include<iomanip> std::string char2bin( char c ) { std::string result( 8, '0'); int bit = 8; while( bit-- ) { result[bit] += (c & 0x01); c >>= 1; } return( result ); } template<typename T> std::string tobin( T t ) { std::string result; const size_t size = sizeof( T ); char* p = (char*) &t + size - 1; unsigned int s = size; while( s-- ) result += char2bin( *p-- ); return( result ); } int main() { double d = 1.2345; float f = 1.2345; std::cout<<std::setprecision(std::numeric_limits<float>::digits10+1)<<d<<" (float) in binary is "<<tobin(f).c_str()<<std::endl; std::cout<<std::setprecision(std::numeric_limits<double>::digits10+1)<<d<<" (double) in binary is "<<tobin(d).c_str()<<std::endl; }
Write a program that sort any array of integers using pointers?
#include<iostream> void insertion_sort(int* a,int len) { for(int i=1; i<len; ++i) { int* hole=a+i; int* prev=hole-1; int cur=*hole; while(hole!=a && cur<*(prev)) { *(hole)=*(prev); --hole, --prev; } *hole=cur; } } void print_array(int* a,int len) { for(int i=0; i<len; ++i) std::cout<<a[i]<<" "; std::cout<<std::endl; } int main() { int a[]={9,1,8,3,7,2,5,4,6}; int size=sizeof(a)/sizeof(a[0]); std::cout<<"Before:\t"; print_array(a,size); insertion_sort(a,size); std::cout<<"After:\t"; print_array(a,size); return(0); }
How to program set Cardinality in C plus plus?
The cardinality of a set is simply the number of elements in the set. If the set is represented by an STL sequence container (such as std::array, std::vector, std::list or std::set), then the container's size() member function will return the cardinality. For example: std::vector<int> set {2,3,5,7,11,13}; size_t cardinality = set.size(); assert (cardinality == 6);
Bubblesort in c plus plus enter number?
Optimised bubble-sort algorithm for use with small vectors of any type: template<typename T> void bubble_sort(std::vector<T>& v) { unsigned size = v.size(); if (1<size) { do { int n = 0; for(int i=1; i<size; ++i) { if (v[i]<v[i-1]) { std::swap (v[i-1], v[i]); n=i; } } size=n; } while (size); } } Note that an insert sort is more efficient for small subsets, but std::sort handles subsets of any size extremely efficiently using a hybrid sorting algorithm.
What does the capacity vector member function return and how should this be used?
The vector::capacity member function returns the capacity of the storage space currently allocated to the vector, in terms of elements. The capacity is not necessarily the same as the size of the vector, but it will always be equal to or greater than the size. You can specify the capacity by using the vector::reserve member function. Reserving space for elements allows the vector to insert new elements into the vector without the need to reallocate. However, the vector automatically reallocates whenever you add more elements than the current capacity allows, and may increase the capacity beyond the new size. To optimise the capacity at any time, use the vector::shrink_to_fit member function.The following code demonstrates how size and capacity relate to each other:#include#includestd::ostream& operator
What is Yamaha rx 135 mrf front tire Size?
2.5 X 18 P-4 is the std size of front tyre of Yamaha rx 135
