PROJECT 4 (Ordering by the method of the bubble)
Sunday, April 25, 2010
Shortness Of Breath With Jelly Earphones
was a bit weird because we had chosen another subject, we decided to change the subject by one who stayed on the air.
already defined in the theme and presentation that is the sort of bubble, including group collaboration, we can deduce that did the animation that explains graphically why he is named so the method of the bubble, as well as its explanation, also run the code example, to make it clearer exposure.
ISSUES THAT I'M GOOD ...
I think I'm good at handling code; although everyone has their own style to the program, because there things I do not understand, because some are new things.
also in the preparation of the subject, research to prepare to make my part of the presentation.
And above all there to make a point that we forget, it is the responsibility of providing a good class, and above all understand what is being said, for I have seen that some people only read the slide.
ISSUES THAT NEED TO IMPROVE ME ....
In the distribution of the time, just understand that there are priorities for tasks, all are important and deserve your time, so, I will try to do things and earrings in the charge me.
In practice more on the issues that we saw in class to understand 100% what we see every week and start preparing for the exam, not to expect only to projects or tasks arriving in order to practice.
HELP ME OR OTHERS SUPPORT THEM .....
think that sometimes help, never supported me, but also there to help a lot, you need to know that you should never count on a certain person is going to solve a certain problem, we must resolve many of the Sometimes our own, "scratching their own nails." Nor
be selfish, as in something that could help my friends and some colleagues know that they helped them, because someday I could offer ami, and I would like to make me a bad face "reap what you sow."
WHO IS RESPONSIBLE TO COORDINATE THE WORK ...
Daniela Aguilar Between my partner and I coordinate the work, as initially decided to get together to form the team for this project, and my other colleagues joined a little later.
ROLE THAT TOOK ME ...
The range that can be deployed on this review, I think that would be more correct and honest ....
Concern, responsibility and anger, as I have a strange character, and I really get stressed when things do not go as planned, but that most of the time led me to do things right, not to fall into despair, the bad thing is when time is over, and you make things go worse, the good thing I've learned is to take things quietly, and with time, and so almost everything was perfect ....
But I'm the type of person who does not forgive a lack of accountability in some work, so in some cases, I prefer them on my own, since it is a team, and is part of the qualification group, and I think not fair that some people work and others do not.
(Lessons learned from the course of my life, as speaker of issues in teams)
********************************************* PRESENTATION
***************************
LEAGUE OF PRESENTATION:
http://www.slideshare.net/agatapato/bubble-sort-algcomp
LINK TO THE BLOGS, MY PARTNERS:
Daniela Anali Aguilar War
Dora Nelly Gonzalez Martinez
Wednesday, April 21, 2010
Toothbrush Receding Gums
representation and manipulation of trees.
This extra task on binary trees, is information from wikipedia, clearing my doubts .
A binary search tree is a particular type of binary tree that has a data structure in a tree used in computing.
all empty tree is a binary search tree.
A nonempty binary tree, rooted in R is a binary search tree if:
• In If you have left subtree, the root R must be greater than the maximum value stored in the hive
left and the left subtree is a binary tree search
.
• If you have the right subtree, the root R must be less than the minimum value stored in the hive
right, and that the right subtree is a binary tree search
.
may have different binary search trees for the same set of elements.
The interest of binary search trees (ABB) is that their tour inorder provides the elements sorted in increasing and that the search for an item is usually very efficient.
Depending on user needs dealing with a structure of this type may allow strict equality in, any or both of the subtrees hanging from the root. Allow the use of equality leads to the appearance of double values \u200b\u200band makes the search more complex. SEARCH
The search is access to the root of the tree, if the element to locate it matches the search has completed successfully, if the item is less you search the left subtree and if it is greater in the right . If a leaf node is reached and the element was not found are not supposed to exists in the tree. Note that the search on this type of tree is very efficient, is a logarithmic function. The maximum number of comparisons would need to determine whether an item is in a binary search tree would be between [log2 (N +1)] and N, N being the number of nodes. The search for an item in an ABB (binary search tree) can be done in two ways, iterative or recursive.
Example iterative version in the C programming language, assuming that we are looking for a key hosted on a node where the relevant "fact" that we need find:
data Buscar_ABB (abb t, key k)
abb {p;
data e;
e = NULL;
p = t;
if (! isEmpty (p))
{while (! isEmpty (p) & & (p-> k! = k))
{if (k \u0026lt; p-> k)
{p = p-> l;
} if (p-> k \u0026lt;k)
{p = p-> r;}
} if (! IsEmpty (p) & & (p-> d! = NULL)) {
copiaDato e = (p-> d);}
} return e;}
Insertion Insertion is similar to the search and can be given an iterative solution both as a resource. If we initially empty tree as a parameter creates a new node as a single content item to insert. If not is, it checks if the given element is less than the initial tree root that is inserted into the left subtree and if more is inserted into the right subtree. In this way the inserts are made in the leaves.
As in the case of the search can be several alternatives when implementing the inclusion in the ADT (abstract data type), and is the decision to take when the item (or key item) to add is already in the tree, this may be modified or ignored it insertion. It is obvious that this operation modifies the losing ABB previous version. PROC
InsertarABB (tree: TABB; data: TElement)
ele VARIABLES: TElement
HOME IF (ABBVacío (tree)) THEN
tree \u0026lt;- NEW (TNodoABB)
tree ^. left \u0026lt;- NULL
tree ^. der \u0026lt;- NULL
tree ^. elem \u0026lt;- data
otherwise
InfoABB ele = (tree)
SI (dato.clave \u0026lt;ele.clave) THEN
InsertarABB (tree ^. Left, data)
otherwise
InsertarABB (tree ^. dch, data)
FINSI
FINSI
FIN
Disposal:
The operation deletion is more complicated, the search and insertion.
There are several cases to consider:
* Remove a node or leaf node with no children, only clears and sets to zero the pointing of his father.
* Remove a child node to a subtree: elnodo clears and is assigned its subtree subtree son as his father. * Remove a child node with two hives: the solution is to replace the value of the node by its predecessor or its successor in the inorder and then delete this node.
inorder Its predecessor is the node to the right of its left subtree (left-most node of the subtree), and its successor node to the left of its right subtree (subtree node lower right).
reviewing and understand a little better.
this information can be found at: wikipedia / / binary tree 
This extra task on binary trees, is information from wikipedia, clearing my doubts .
A binary search tree is a particular type of binary tree that has a data structure in a tree used in computing.
all empty tree is a binary search tree.
A nonempty binary tree, rooted in R is a binary search tree if:
• In If you have left subtree, the root R must be greater than the maximum value stored in the hive
left and the left subtree is a binary tree search
.
• If you have the right subtree, the root R must be less than the minimum value stored in the hive
right, and that the right subtree is a binary tree search
.
may have different binary search trees for the same set of elements.
The interest of binary search trees (ABB) is that their tour inorder provides the elements sorted in increasing and that the search for an item is usually very efficient.
Depending on user needs dealing with a structure of this type may allow strict equality in, any or both of the subtrees hanging from the root. Allow the use of equality leads to the appearance of double values \u200b\u200band makes the search more complex. SEARCH
The search is access to the root of the tree, if the element to locate it matches the search has completed successfully, if the item is less you search the left subtree and if it is greater in the right . If a leaf node is reached and the element was not found are not supposed to exists in the tree. Note that the search on this type of tree is very efficient, is a logarithmic function. The maximum number of comparisons would need to determine whether an item is in a binary search tree would be between [log2 (N +1)] and N, N being the number of nodes. The search for an item in an ABB (binary search tree) can be done in two ways, iterative or recursive.
Example iterative version in the C programming language, assuming that we are looking for a key hosted on a node where the relevant "fact" that we need find:
data Buscar_ABB (abb t, key k)
abb {p;
data e;
e = NULL;
p = t;
if (! isEmpty (p))
{while (! isEmpty (p) & & (p-> k! = k))
{if (k \u0026lt; p-> k)
{p = p-> l;
} if (p-> k \u0026lt;k)
{p = p-> r;}
} if (! IsEmpty (p) & & (p-> d! = NULL)) {
copiaDato e = (p-> d);}
} return e;}
Insertion Insertion is similar to the search and can be given an iterative solution both as a resource. If we initially empty tree as a parameter creates a new node as a single content item to insert. If not is, it checks if the given element is less than the initial tree root that is inserted into the left subtree and if more is inserted into the right subtree. In this way the inserts are made in the leaves.
As in the case of the search can be several alternatives when implementing the inclusion in the ADT (abstract data type), and is the decision to take when the item (or key item) to add is already in the tree, this may be modified or ignored it insertion. It is obvious that this operation modifies the losing ABB previous version. PROC
InsertarABB (tree: TABB; data: TElement)
ele VARIABLES: TElement
HOME IF (ABBVacío (tree)) THEN
tree \u0026lt;- NEW (TNodoABB)
tree ^. left \u0026lt;- NULL
tree ^. der \u0026lt;- NULL
tree ^. elem \u0026lt;- data
otherwise
InfoABB ele = (tree)
SI (dato.clave \u0026lt;ele.clave) THEN
InsertarABB (tree ^. Left, data)
otherwise
InsertarABB (tree ^. dch, data)
FINSI
FINSI
FIN
Disposal:
The operation deletion is more complicated, the search and insertion.
There are several cases to consider:
* Remove a node or leaf node with no children, only clears and sets to zero the pointing of his father.
* Remove a child node to a subtree: elnodo clears and is assigned its subtree subtree son as his father. * Remove a child node with two hives: the solution is to replace the value of the node by its predecessor or its successor in the inorder and then delete this node.
inorder Its predecessor is the node to the right of its left subtree (left-most node of the subtree), and its successor node to the left of its right subtree (subtree node lower right).
reviewing and understand a little better.
this information can be found at: wikipedia / / binary tree
Subscribe to:
Posts (Atom)