Posts by ganmo | DaniWeb

ganmo 36 Light Poster

14 Years Ago

Re: how to reverse a string by using array method.?

Problem occurs within your loop-condition. It will continue as long as x>=0, since the it always fulfill it won't stop.

Software Development c

ganmo 36 Light Poster

15 Years Ago

Re: starting out with a linked list

>new_node->first->next = my_list->first;
my_list is a type, not an object. Perhaps you meant:
new_node->first->next = my_this->first;

I did wrong there, thanks for pointing out...
I hit at problem again though. I have written a test code to see whether it will add to the linked list without problem. It will add the first set of values without problem. However it crashes during the second add.

I thought I got most of the requisite now.
1. create a new node
2. add values to the node
3. point the new nodes to the first node
4. change first node address to the new node

Have I missed out something?

void list_add(struct my_list* my_this, int key, double value)
{
    // ADD YOUR CODE HERE (approx 23 lines)
    cout << key << " " << value << endl;
    my_list *new_node;

	//allocate memory for next node
	//typecast to (my_list) is needed here
    new_node = (my_list*)malloc(sizeof(my_list));

    if(my_this)
    {
        cout << "pang" << endl;

        //adding key and value
        new_node->first->key = key;
        new_node->first->value = value;

        new_node->first->next = my_this->first;

        //point new_node to become the first element
        my_this->first = new_node->first;

    }
}

Software Development c linked-list

ganmo 36 Light Poster

15 Years Ago

Re: starting out with a linked list

Ah sry, I was unsure whether it is C or C++. I guess C since it uses malloc...

anyway I've continued on it and got stuck again...

void list_add(struct my_list* my_this, int key, double value)
{
    cout << key << " " << value << endl;
    my_list *new_node;

	//allocate memory for next node
	//typecast to (my_list) is needed here
    new_node = (my_list*)malloc(sizeof(my_list));

    if(my_this)
    {
        new_node->first->key = key;
        new_node->first->value = value;

        new_node->first->next = my_list->first;

    }
}

Now that I have assigned values to the new created node, I want to attach it to the linked list.

So I'm guessing this part
new_node->first->next = my_list->first;
needs to be attached to my_list->first. However doesnt work so well. It is complaining about "expected primary-expression...."

Software Development c linked-list

ganmo 36 Light Poster

15 Years Ago

starting out with a linked list

Hey, I am currently following a code skeleton to implement the missing code for some function. Below is only some part of the implementation I've done so far. Yes it is not much yet...
I got stuck for the implementation of the list_add() function.

What I want to do there is to create a new node, and allocate some memory to it so I afterward can insert values to it. However I get compilation error. I have trial error it for awhile now without founding any solution. So I hoped for if someone know what error it is.

The error I get is

error: invalid conversion from `void*' to `my_list*'

#include <iostream>

using namespace std;

struct list_item
{
    int key;                // identifies the data
    double value;           // the data stored
    struct list_item* next; // a pointer to the next data
};

struct my_list
{
    struct list_item* first; // a pointer to the first element of the list
};

void list_init(struct my_list* my_this)
{
    my_this = NULL;
}

void list_add(struct my_list* my_this, int key, double value)
{
    my_list *new_node;
	
	//allocate memory for next node
    new_node = malloc(sizeof(my_list));
}

int main()
{
	my_list a;
	list_init(a);
	
	return 0;
}

Software Development c linked-list

ganmo 36 Light Poster

15 Years Ago

Q. Dynamic allocated array

Hi I've been struggling with this for a very long time now. And I can't seem to get it done.

I want to make an array, dynamic allocted array. Which act something like an vector (I know c++ has vector). So my approach was to create a list_add() function. Its purpose is to add new integer values to the array, and to increase the array size if it hits end of it.

Here's the problem. What I want to do in the code is to create a new dynamic allocated array, and rellocate the values from the old array to the new one. After that I want the new array to be recognized as the old one. However it does not seem to do it.

Can anyone point out to be if this is the correct approach, and what I did wrong in the code?

This is the test main

int main()
{
    const int N = 7;

    //declaring dynamic array allocation
    int* list = new int[N];

    int used = 0;//, a_val;

    //and some scrap values
    for(int i=0;i<11;i++)
    {
        list_add(list, used, N, i);
    }

    cout << endl << "Size: " << N << endl << endl;
    cout << "Prints the list " << endl;
    for(int i=0;i<used;i++)
    {
        cout << list[i] << ". ";
    }

}

This is the function

bool list_add(int list[], int& space_used, int max_size, int value)
{


    if(max_size-space_used > 0)
    {
        list[max_size-space_used-1] = value;
        space_used++;
        return true;
    }
    else
    {
        cout << …