All categories

2 years ago

Algorithm to eat orange

Computers and Technology

2 answers:

4vir4ik [10]2 years ago

8 0

Answer:

Start by cutting it in half, straight down. Then, make two cuts to either side, angling your knife towards the center of the orange. Eat the orange directly from the peel. Place the flesh part of the orange into your mouth, with the peel between your lips like a big, orange smile.

Explanation:

its that easy

joja [24]2 years ago

5 0

Answer:

Cut an orange into a strip.

Next, cut a slit into the side of the orange, all the way down to the core. The slit should go from one cut end to the other. Finally, use your fingers to pry open the orange, like a book, into a long strip. Use your fingers to pull the orange segments off of the peel, and eat them.

Explanation:

You might be interested in

1) List at least five smaller behaviors you could break the complex behavior "brushing my teeth" into.

zhuklara [117]

Q1:
1. Go into the bathroom
2. Put toothpaste on the toothbrush
3. Place head of toothbrush on your teeth
4. Revolve in small circles
5. Repeat 4 for all of your teeth
6. Use water to wash away the toothpaste in you mouth

5 0

2 years ago

Read 2 more answers

Suppose we wanted to make change for purchases and wanted to use the least number of coins possible. Here is a greedy algorithm:

love history [14]

Answer:

Explanation:

The following code is a Python function that takes in the amount of change. Then it uses division and the modulo operator to calculate the number of coins that make up the changes, using the greatest coin values first.

import math

def amountOfCoins(change):

print("Change: " + str(change))

quarters = math.floor(change / 0.25)

change = change % 0.25

dimes = math.floor(change / 0.20)

change = change % 0.20

pennies = math.floor(change / 0.01)

print("Quarters: " + str(quarters) + "\nDimes: " + str(dimes) + "\nPennies: " + str(pennies))

5 0

2 years ago

what is the largest possible number of internal nodes in a redblack tree with black height k? what is the smallest possiblenumbe

Elina [12.6K]

Answer:

A Red Black Tree is a type of self-balancing(BST) in this tree ,each node is red or black colored. The red black tree meets all the properties of the binary search tree, but some additional properties have been added to a Red Black Tree.

A Red-Black tree's height is O(Logn) where (n is the tree's amount of nodes).

In a red-black tree with black height k

The maximum number of internal nodes is $2^{2k}$ $-1$ .

The smallest possible number is $2^{k}$ $-1$ .

7 0

2 years ago

What is the difference between the default constructor and the overloaded constructor?

lukranit [14]

Explanation:

A default constructor is a constructor that present in the class by default with no parameters when we write a new constructor with parameters it is called overloaded constructor.There can be different overloaded constructors in the same class.

The main difference between default constructor and overloaded constructor is that the default constructor does't have any parameters while the overloaded constructors have parameters.

4 0

3 years ago

Click to review the online content. Then answer the question(s) below, using complete sentences. Scroll down to view additional

lbvjy [14]

Answer: you can say or talket to them why or how

Explanation:

4 0

3 years ago

Read 2 more answers

Algorithm to eat orange​

Algorithm to eat orange