[x]
Posted via EE Mobile

Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again.

Question
[x]
Attachment Details
[x]
The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

  • The Grade of the Solution
  • The Zone Rank of the Expert Providing the Solution
  • The Number of Author and Expert Comments
  • The Number of Experts Contributing
  • The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

7.8

Data structures using Pseudocode with C

Asked by jhook53 in C Programming Language

Tags: pseudocode, data, c, structures

write an algorithm that accepts a linked list, traverses it and retrurns the data in the node with the minimum key value. ( data is the key ; so we should have to compare the data of each node until we find the minimum value)

  My start ;


 algorithm minimum  (val pList <head pointer>)

     This algorithm accepts a link list , traverses it and returns the data in the node with the minimum key value.
      Pre = pList is a valid pointer to the head of     the list
      Post= the data with the minimum key value has been returned or in the case of an empty list , an invalid data is returned

      If (fromwhere is 0)    start at first element
     1 If (pList -> count is zero)
        1 return ( invalid data value) checks null list

this is where I dont how to continue I can use a pWalker or a pList ->pos . one way or the other we have to keep track of where we are and where we are going , plus compare data nodes , I was going to use datakey as the variable to compare the data at each position .

dataptr =  address ( pList -> pos -> data)  tracks address

then some how I have to move to the next node .If data is not less then what is in datakey ignore.Go to next data node until end of list and terminate.

 2 pList ->pos = pList ->head
 3 dataptr =  address ( pList -> pos -> data)
 4 datakey <  data ( pList -> pos -> data ) compares data
 5 sucess  = true

Now I am not sure what else to proceed with , and how to show the minimum key value . I could tell it to print it out  or can I display it to the screen.

any help would be greatly appreciated .
I am using the Data Structures Pseudocode Approach in C.
Gilberg and Forouzan

thank you
jerry
[+][-]02/20/03 07:58 PM, ID: 7991517Accepted Solution

View this solution now by starting your 30-day free trial. Setting up your free trial is quick, easy, and secure. We will return you to this solution, unlocked, when you're done.

About this solution

Zone: C Programming Language
Tags: pseudocode, data, c, structures
Sign Up Now!
Solution Provided By: ellesd
Participating Experts: 2
Solution Grade: A
 
[+][-]03/04/03 04:45 PM, ID: 8068571Author Comment

Often, when Experts are collaborating with members who have asked questions, they will request additional information about the problem. Askers respond with an author comment like this one.

Start your 30-day free trial to view this Author Comment or ask the Experts your question.

 
[+][-]12/29/03 07:13 AM, ID: 10010887Expert Comment

At Experts Exchange, members can ask their questions to thousands of technology professionals, also known as Experts. Experts compete and collaborate to answer those questions by leaving comments like this one.

Start your 30-day free trial to view this Expert Comment or ask the Experts your question.

 
[+][-]01/05/04 03:46 AM, ID: 10041870Administrative Comment

Experts Exchange has a courteous staff of administrators who help members get the most out of the website by means of administrative comments like this one.

Start your 30-day free trial to view this Administrative Comment or ask the Experts your question.

 
 
Loading Advertisement...
20091111-EE-VQP-92