What would you like to do?
- determines the fitness of an organism by direct application.
- employs a wide range of criteria
- provides for opportunism
- involves a lot of chance.
- some organisms escape the full range of possible criteria
- is under employed in boom times, over-employed in lean times.
- recessive traits 'hide' from the process.
8 people found this useful
Was this answer useful?
Thanks for the feedback!
disadvantage: selective breeding gets rid of variety advantage: selective breeding rules out weakness and disability disadvantage: isn't that what Hitler tried to do with …humans in WWII? do we really want to be like him? Selective breeding(or artificial selection) produces traits which may be advantagious to us, but be a disadvantage to the animal.Here are some examples-The lapps of northern Europe herd and breed the wild deer, selecting docile animals. The resulting herds could not survive in the wild.Cows with big udders are good for us , but are probably painful for the cow. English bulldogs mght be considered a cool looking dog, but have breathing difficulties and such small pelvises that they often have to give birth by causation. Advantages: Can produce fitter, stronger animals or animals of a higher yield of milk, meat or eggs for example. Can produce animals better suited to survive in poor climates or marginal conditions, thus preserving human food supplies and saving life. Can ensure the eradication of hereditary sickness in some blood lines. Disadvantages: For show animals such wild kitten eatingas some dogs, it is practised quite strictly by breeders aiming at a certain look which is set down as the breed "standard"- many Dalmation puppies are euthanased because they do not exhibit the breed standards for example, so there are serious moral questions to it too.Too much close interbreeding to obtain certain cosmetic traits can also result in the amplifying of inherent illnesses - like the bulldogs mentioned above, or German shephered dogs with hip problems and so on - in fact, these issues are rapidly worsening in recent years with dogs in particular. keep in mind it will eat your babies if you anger them.
advantages: we get more breeds and more animals/plants easier people can make more more Disadvantages the animals/plants can have genetic diseases It is har…d to get rid of the genetic diseases because you have to breed them out
afaadad it saves the environment
They may cause mutations Artifical selection is the process of interntional, or unentitional modeifcation of a species through human actions which encourage the breeding of c…ertain traits over others. Some disadvantages of artificial selection is that it is inhumane, can cause mutations or produce new problems. An example of the inhumane process is the new way of breeding chickens. These chickens are produced without fethers. Critics say the feather-free chickens will suffer more than normal birds. Males might be unable to mate, because they cannot flap their wings, and "naked" chickens of both sexes are more susceptible to parasites, mosquito attacks and sunburn.
There are a great many advantages and disadvantages of natural rain. One advantage is that you don't have to water plants.
Nature is a range of animals lol :)x
Natural selection can help creatures adapt to their enviorment. Sometimes this can cause unwanted problems.
The advantages of natural fertilizers would be that they are not made of chemicals and not harmful for the body. A disadvantage is that they smell bad and don't work as we…ll.
Advantages: It only cuts down the valuable trees that are needed meaning it leaves a larger range of biodiversity. Disadvantages: Selective logging can harm the trees surrou…nding the ones being targeted which can be more disastrous than normal logging as it can cause diseases through the trees. On average, for every tree that is cut down for selective logging, 4 more are injured and are left. that is a large waste of wood, meaning they have to cut down more trees to make up for the wasted wood.
please advt they are smoother disadvt they are costly
to identify who is the best suited person to play and play off
Advantage is that some natural resources are renewable, ex: trees, disadvantage well some are nonrenewable, ex: oil.
Advantages: Easy to implement In-place sort (requires no additional storage space) Disadvantages: Doesn't scale well: O(n2)
The advantages of natural resources would be that they can be used in everyday life, and they're made from the earth. Some disadvantages would probably be that oil is a natu…ral resource and it can kill animals, coal factories fumes are killing trees and leaving off toxic fumes, and oil drilling harms animals habitats, in the ocean or on land.
Selective tendering has a low cost for production of tender documents since there is a small list of selected firms to tender. Price will be the main determinant for selection…, since all other considerations would have been done already making the analysis process simple and faster.
Various advantages of selective distribution include reduced costs, increased market coverage, and better control over sales. Disadvantages may include that it does not co…ver the market well enough or that it becomes difficult to match specific retailers and dealers to your needs.
Selection sort is ideally suited to sorting small sets and, since it does not require random access, can be adapted to sort both lists and arrays. However, insert sort gen…erally performs better when sorting arrays. To understand the disadvantage, you need to compare the algorithms. Selection sort starts by treating the entire set as the unsorted set. It then assumes the first element is the largest element and begins comparing all other elements to this element. When it finds a larger or equal element, the remaining elements are compared to this element. Once all elements have been compared, the largest element will have been located. This is then swapped with the last element. The last element then becomes the first element of the sorted set and the unsorted set is reduced by one element. The algorithm repeats until there is only one element in the unsorted set, at which point the entire set is sorted. That one element is always the smallest element because everything in the sorted set is either larger or equal to it, thus it is already in place. Thus for a set of n elements, there are n-1 iterations. Each iteration requires n-1 comparison operations (where n reduces by one at the end of each iteration) and 1 swap operation. With insert sort we build the sorted set at the beginning of the set rather than the end. A set of one can always be regarded as being sorted, thus we begin with a sorted set of 1 and an unsorted set of n-1 elements. We then copy the first element from the unsorted set, thus creating a gap between the sorted and unsorted sets. If the element to the left of that gap is larger than the copied element, we move that element into the gap, one position to the right, which subsequently moves the gap one position to the left. If the gap reaches the beginning of the sorted set or the element to its left is not larger than the copied element, then we place the copied element in the gap. We then repeat the process for the next unsorted element until there are no more unsorted elements. Thus there are n-1 iterations (same as for selection sort) and at least two copies per iteration (one to move the element out of the unsorted set, and another to move it back into the sorted set). On each iteration, a sorted set of k elements will require 1 to k comparison operations and a similar number of move operations. Since we stop comparing when we have found the insertion point, we will generally perform fewer comparisons overall than selection sort unless the unsorted set happens to be in reverse order. However, we will incur more move operations depending on where the insertion point lands on each iteration (bearing in mind that a swap is equivalent to 3 move operations). Thus for a set of 10 elements, selection sort will perform 9 iterations, with 9+8+7+6+5+4+3+2+1=45 comparisons and 2x9=18 swaps (equivalent to 54 move operations), thus we have 99 operations in total. Insert sort would also require 9 iterations, however the number of comparisons and moves will vary. In the best case, where the set is already sorted, there will be a minimum of 9 comparisons and 18 moves (27 operations in total) and in the worst case, where the set is in reverse order, there will be 45 comparisons and 3+4+5+6+7+8+9+10+11=63 moves, thus we have 108 operations in total. While there will inevitably be some cases where selection sort outperforms an insert sort, in the vast majority of cases insert sort will be substantially quicker than selection sort, because selection sort will always take 99 operations to sort a set of 10 elements, whereas insert sort will take anything from 27 to 108 operations, with an average case of 68 operations. Selection sort can be improved slightly by testing the position of the largest element. If it is already the final element of the unsorted set, then we do not need to swap, however this adds an extra comparison to each iteration whether we swap or not. Thus the best case, where the set is already sorted, becomes 54 comparisons with no swaps, and the worst case becomes 54 comparisons with 18 swaps, giving a range of 54 to 108 operations with an average of 81 operations. While this will increase the number of cases where a selection sort outperforms insert sort, selection sort still comes off worst overall.