All categories

3 years ago

It's in Python, everything sort of explained in the image below,

Computers and Technology

1 answer:

sesenic [268]3 years ago

7 0

To be able to write algorithms in pseudocode, one needs to learn the programming language.

<h3>How to write an algorithm in the pseudocode?</h3>

For writing the algorithms in a pseudocode, one must be able to understand the programming language, for which each of the steps shall be arranged properly in a sequential manner.

The instruction to be given to the code are to be written in uppercase, whereas lowercase is used for displaying the messages in the sentence. The command of input, is used for asking questions.

Hence, the ways to write an algorithm in a pseudocode is explained above.

Learn more about pseudocode here:

brainly.com/question/13208346

#SPJ1

You might be interested in

Create a public class Dog that stores a single double age set by the constructor. (Reject negative ages using assert.) Dog shoul

hjlf

Answer:

Explanation:

The following is written in Java and has the methods as requested in the question...

class Dog {

private double age;

public Dog(double v) {

assert v >= 0:" Not valid";

this.age = v;

}

public boolean isOlder(Dog dog1, Dog dog2) {

if (dog1.age > dog2.age) {

return true;

} else {

return false;

}

7 0

3 years ago

What are the five types of alignment in Word?

Basile [38]

There are four types of alignment in word.
Left-aligned text
Right-aligned text
Center-aligned text
Justified text

6 0

4 years ago

Read 2 more answers

William has created a page view style sheet and saved it in a file named esd.css. What tags should William add to the document h

EleoNora [17]

Answer:

The answer is "<link href="esd.css" rel="stylesheet" />".

Explanation:

William will use the <link> tag because this tag is used to describe a connection between an external resource and an HTML file. In the <link> tag we use the href and rel attribute that is used to specify an anchor element target or destination and to define the current-linked file associate with.

This tag is an empty element, it contains only attributes.
The < link > tag is used to add existing style sheets.
The <link> tag also known as Singular Tag.

8 0

3 years ago

In total, how many 8-bit registers are there in the Intel 80x86 CPU design presented in class? Name one of these 8-bit registers

RSB [31]

Answer:

In general the number of bit registers in Intel 80x86 CPU design when combined together forms a 16 - bit register

An example of the -bit registers are AH, AL, BH, BL, CH, CL, DH, and DL

Explanation:

Solution

The 8086 CPU design has a total of eight 8-bit registers and these register can be integrated together to make 16- bit register as well.

The 16-bit data is stored by breaking the data into a low-order byte and high order byte.

The name of the 8 bit registers is shown below:

AH, AL, BH, BL, CH, CL, DH, and DL

7 0

3 years ago

Data Structure in C++

agasfer [191]

The code .cpp is available bellow

#include<iostream>

using namespace std;

//declaring variables

void merge(int* ip, int sz, int* opt, bool opt_asc); //merging

int* mergesort(int* ip, int sz);

void mergesort(int *ip, int sz, int* opt, bool opt_asc);

void merge(int* ip, int sz, int* opt, bool opt_asc)

{

int s1 = 0;

int mid_sz = sz / 2;

int s2 = mid_sz;

int e2 = sz;

int s3 = 0;

int end3 = sz;

int i, j;

if (opt_asc==true)

{

i = s1;

j = e2 - 1;

while (i < mid_sz && j >= s2)

{

if (*(ip + i) > *(ip + j))

{

*(opt + s3) = *(ip + j);

s3++;

j--;

}

else if (*(ip + i) <= *(ip + j))

{

*(opt + s3) = *(ip + i);

s3++;

i++;

}

if (i != mid_sz)

{

while (i < mid_sz)

{

*(opt + s3) = *(ip + i);

s3++;

i++;

}

if (j >= s2)

{

while (j >= s2)

{

*(opt + s3) = *(ip + j);

s3++;

j--;

}

else

{

i = mid_sz - 1;

j = s2;

while (i >= s1 && j <e2)

{

if (*(ip + i) > *(ip + j))

{

*(opt + s3) = *(ip + i);

s3++;

i--;

}

else if (*(ip + i) <= *(ip + j))

{

*(opt + s3) = *(ip + j);

s3++;

j++;

}

if (i >= s1)

{

while (i >= s1)

{

*(opt + s3) = *(ip + i);

s3++;

i--;

}

if (j != e2)

{

while (j < e2)

{

*(opt + s3) = *(ip + j);

s3++;

j++;

}

for (i = 0; i < sz; i++)

*(ip + i) = *(opt + i);

}

int* mergesort(int* ip, int sz)

{

int* opt = new int[sz];

mergesort(ip, sz, opt, true);

return opt;

}

void mergesort(int *ip, int sz, int* opt, bool opt_asc)

{

if (sz > 1)

{

int q = sz / 2;

mergesort(ip, sz / 2, opt, true);

mergesort(ip + sz / 2, sz - sz / 2, opt + sz / 2, false);

merge(ip, sz, opt, opt_asc);

}

int main()

{

int arr1[12] = { 5, 6, 9, 8,25,36, 3, 2, 5, 16, 87, 12 };

int arr2[14] = { 2, 3, 4, 5, 1, 20,15,30, 2, 3, 4, 6, 9,12 };

int arr3[10] = { 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 };

int *opt;

cout << "Arays after sorting:\n";

cout << "Array 1 : ";

opt = mergesort(arr1, 12);

for (int i = 0; i < 12; i++)

cout << opt[i] << " ";

cout << endl;

cout << "Array 2 : ";

opt = mergesort(arr2, 14);

for (int i = 0; i < 14; i++)

cout << opt[i] << " ";

cout << endl;

cout << "Array 3 : ";

opt = mergesort(arr3, 10);

for (int i = 0; i < 10; i++)

cout << opt[i] << " ";

cout << endl;

return 0;

}

4 0

4 years ago