Search:

I'm almost positive that this should work, I'm just having some difficulty adding the nodes to the new lists..

I'm calling the split function in main in a loop

for(r = 0; r < matrix->rows; r++)...

Or maybe something like this...

void split( MATRIX *matrix , NODE **list_1, NODE **list_2)
{
int r;


for(r = 0; r < matrix->rows; r++)
{
AddToList(matrix->m[r],...

void split( MATRIX *matrix , NODE **list_1, NODE **list_2)
{
int r, count;

count = 0;
for(r = 0; r < matrix->rows; r++)
{
if(count >= r)
add to...

Oh I see.. so maybe something like



void split( MATRIX *matrix , NODE **list_1, NODE **list_2)
{
int r;

for(r = 0; r < matrix->rows; r++)
{

I've had a few days to dabble in this and unfortunately procrastination got the best of me. I tried combining the two bits in the same loop but all to no avail..

Can you give me some hints as to...

Thank you!

I managed to eventually split the bottom half...
the only catch being that if I do so, the top half won't split properly.

I know I have to use new header nodes, but I figured I...

I've managed to successfully split the top half


void split( MATRIX *matrix ) // must be changed
{
int r, s;
NODE* pPre, *pNext, *pPre2, *pNext2;

//split top half into...

So I have a square matrix composed of several linked lists, all containing random integers.
The data diagram looks like this so far:
11335

Here's all the source code for now:



#include...