Web design is awesome! Alright, so -

If you want to call some attention to text, you need to focus on the basic essentials.

You want your text to be brief and split up. If someone goes on your site and see's walls of text, they'll be overwhelmed and leave.

So, to call attention - make it brief, and split it up into nice paragraphs.

Another way to call attention to text is to have a really good colour scheme. Having text easy on the eyes attracts the reader more, and encourages them to dive deeper.

If your text is unattractive and hard to look at it, it'll certainly get their attention - but not the attention you want.

Finally, another way to call attention is with visual adjustments such as making text bold, making it italicised, making it ALL CAPS, or just GOING CRAZY WITH UNNECESSARY TEXT ATTENTION ATTRACTING POWER!!!!!!!

Ahem... Anyways, these are just a few ways to get their attention. =) If you need any other help, private message me because I love web development! =)

4 0

2 years ago

What shoul i get, Airpods or a ps4 cooling fan ???

Fynjy0 [20]

Answer:

Airpods, there is ps5 coming out

Explanation:

3 0

2 years ago

Read 2 more answers

Recursively computing the sum of the first n positive odd integers, cont. About (a) Use induction to prove that your algorithm t

julia-pushkina [17]

The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.

int recursiveOddSum(int n) {

if(2n-1==1) return 1;

return (2n-1) + recursiveOddSum(n-1);

}

To prove the correctness of this algorithm by induction, we start from the base case as usual:

$f(1)=1$

by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).

Now we can assume that $f(n-1)$ returns indeed the sum of the first n-1 odd numbers, and we have to proof that $f(n)$ returns the sum of the first n odd numbers. By the recursive logic, we have

$f(n)=f(n-1)+2n-1$

and by induction, $f(n-1)$ is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, $f(n)$ is the sum of the first n odd numbers, as required:

$f(n)=\underbrace{\underbrace{f(n-1)}_{\text{sum of the first n-1 odds}}+\underbrace{2n-1}_{\text{n-th odd}}}_{\text{sum of the first n odds.}}$

6 0

3 years ago