The elements in a string type array will be initialized to "Null".
Answer:
i think it might c but dont trust me
<u>C++ program - Insertion sort</u>
<u></u>
#include <bits/stdc++.h>
using namespace std;
/* Defining function for sorting numbers*/
void insertionSort(int array[], int n)
{
int i, k, a;
for(i=1;i<n;i++)
{
k=array[i];
a=i-1;
while(a>=0 && array[a] > k) // moving elements of array[0 to i-1] are greater than k, to one position //
{
array[a+1] = array[a];
a =a-1;
}
array[a+1] =k;
}
}
/* Driver function */
int main()
{
int array[] = { 12,56,76,43,21};
//input integers
int n = sizeof(array) / sizeof(array[0]);
//finding size of array
insertionSort(array, n);
//Calling function
for (int i = 0; i < n; i++)
//printing sorted array
cout << array[i] << " ";
cout << endl;
return 0;
}
Answer:
The answer to this question can be given as:
Program:
#define class.
class PersonInfo:
def __init__(self): #constructor
self.num_kids = 0
def inc_num_kids(self): #define function inc_num_kids()
self.num_kids = self.num_kids + 1
return self.num_kids #return value.
p= PersonInfo() # creating object
print('Kids:', p.num_kids) #print value
p.inc_num_kids() #call function
print('New baby, kids now:', p.num_kids) #print value
Output:
Kids: 0
New baby, kids now: 1
Explanation:
The description of the above python program as follows:
- In this program firstly we define the class that is PersonInfo. In this class we define the constructor that is def __init__() and one function that is def inc_num_kids().
- The constructor is called automatically when the class object is created. In this constructor, we use the self as a parameter that is used to access variables that belong to class.
- In the constructor, we define the variable that is "num_kids". We assign value to a variable that is "0" and use the self for holding reference to the variable.
- Then we define the function. In this function, we increment the value of the variable by 1 and return its value.
- Then we create a class object that is p and call the function and print its value.