Sqrt linked lists

-


I present a (novel?) variation of a linked list, which allows for insertion, deletion and querying in worse case O(sqrt(n))

If these things interest you, you may like to look at:


// Written by Ryan Ong (z5419383)
// on 14/04/2022

/**
 * Sqrt Linked List!
 * I want to answer these queries in about sqrt(n) steps:
 *    - "insert this value at index i"
 *    - "remove the value at index i"
 *    - "what is the value at index i" 
 *
 * The main difficulty boils down to finding the node at index "i" quickly. For 
 * each range of length sqrtn, I would store the number of nodes in the range, 
 * and also a pointer to the first node in the range.
 * 
 * To find an index i would walk the ranges to find the best one, then walk 
 * through the nodes until index i. Every sqrtn queries, recalculate the ranges,
 * such that the number of steps never grows too large.
 */

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#define TRUE 1
#define FALSE 0

#define CMD_INSERT 'I'
#define CMD_REMOVE 'R'
#define CMD_QUERY 'Q'
#define CMD_PRINT 'P'
#define CMD_UPDATE_RANGES 'U'

struct Range;

struct Node {
    int data;
    struct Node *next;
    struct Range *range;
};

struct Range {
    int num_contained; // number of nodes in this range, usually around sqrt(N)
    struct Node *checkpoint;
    struct Range *next;
};

struct List {
    int num_contained; // total number of nodes, otherwise denoted as N
    struct Node *head;
    struct Range *range;
};

// initialise a sqrt linked list, given that it contains "first_val"
// [0 steps]
struct List *init(int first_val) {
    struct Node *first_node = malloc(sizeof(struct Node));
    first_node->data = first_val;
    first_node->next = NULL;
    
    struct Range *first_range = malloc(sizeof(struct Range));
    first_range->num_contained = 1;
    first_range->next = NULL;

    first_range->checkpoint = first_node;
    first_node->range = first_range;

    struct List *list = malloc(sizeof(struct List));
    list->num_contained = 1;
    list->head = first_node;
    list->range = first_range;
    
    return list;
}

// return the node at that index
// [2sqrt(N) steps]
struct Node *get_node(struct List *list, int index) {
    int total = 0;

    // step through the ranges until you find the range that covers this index
    struct Range *curr_range = list->range;
    while (total + curr_range->num_contained < index) {
        total += curr_range->num_contained;
        curr_range = curr_range->next;
    }

    // then, step through the nodes in this range until you reach the index
    struct Node *curr_node = curr_range->checkpoint;
    while (total + 1 <= index) {
        total++;
        curr_node = curr_node->next;
    }

    return curr_node;
}

// insert val after this index
// note that this function cannot deal with prepending
// [2sqrt(N) steps]
void insert(struct List *list, int index, int val) {
    struct Node *curr_node = get_node(list, index);
    
    struct Node *new_node = malloc(sizeof(struct Node));
    new_node->data = val;
    new_node->next = curr_node->next;
    new_node->range = curr_node->range;
    new_node->range->num_contained++;

    curr_node->next = new_node;
}

// remove the node at this index
// [2sqrt(N) steps]
void rem(struct List *list, int index) {
    struct Node *curr_node;
    if (index == 0) {
        curr_node = list->head;
        list->head = curr_node->next;
    } else {
        curr_node = get_node(list, index);
        get_node(list, index - 1)->next = curr_node->next;
    }

    curr_node->range->num_contained--;
    // edge case: the node to be removed is a checkpoint node, change the 
    // checkpoint to something else
    if (curr_node == curr_node->range->checkpoint) {
        curr_node->range->checkpoint = curr_node->next;
    }
    free(curr_node);
}

// return the data of the node at this index
// [2sqrt(N) steps]
int query(struct List *list, int index) {
    return get_node(list, index)->data;
}

// output the data of the entire list
// [N steps]
void print(struct List *list) {
    for (struct Node *node = list->head; node != NULL; node = node->next) {
        printf("%d ", node->data);
    }
    printf("\n");
}

// clear the linked list of ranges, and create a new one
// this should be called after every sqrt(N) updates
// [N steps]
void update_ranges(struct List *list) {
    int sqrtn = sqrt(list->num_contained);

    list->range = NULL;
    struct Range *prev_range = NULL;
    struct Node *curr_node = list->head;
    while (curr_node != NULL) {
        // initialise this_range
        struct Range *this_range = malloc(sizeof(struct Range));
        this_range->num_contained = 0;
        this_range->checkpoint = curr_node;
        while (curr_node != NULL && this_range->num_contained + 1 <= sqrtn) {
            this_range->num_contained++;
            curr_node = curr_node->next;
        }

        // add "this_range" to the linked list of ranges
        if (list->range == NULL) {
            list->range = this_range;
        } else {
            prev_range->next = this_range;
        }
        prev_range = this_range;
    }
}

// appendix of commands
void print_help() {
    printf("+-----------------+-------------------------------------------+\n");
    printf("|Command Name     | How to Use                                |\n");
    printf("+=================+===========================================+\n");
    printf("| INSERT          | Enter command: I [INDEX] [VALUE]          |\n");
    printf("+-----------------+-------------------------------------------+\n");
    printf("| REMOVE          | Enter command: R [INDEX]                  |\n");
    printf("+-----------------+-------------------------------------------+\n");
    printf("| QUERY           | Enter command: Q [INDEX]                  |\n");
    printf("+-----------------+-------------------------------------------+\n");
    printf("| PRINT           | Enter command: P                          |\n");
    printf("+-----------------+-------------------------------------------+\n");
    printf("| UPDATE RANGES   | Enter command: U                          |\n");
    printf("+-----------------+-------------------------------------------+\n");
    printf("\n");
}

int main(void) {
    //printf("What is the initial value in the sqrt linked list: ");
    int val, i;
    scanf("%d", &val);

    struct List *list = init(val);

    print_help();
    //printf("Enter command: ");

    // read in commands and perform them
    char option;
    while (scanf(" %c", &option) == 1) {
        if (option == CMD_INSERT) {
            scanf("%d %d", &i, &val);
            insert(list, i, val);
        } else if (option == CMD_REMOVE) {
            scanf("%d", &i);
            rem(list, i);
        } else if (option == CMD_QUERY) {
            scanf("%d", &i);
            printf("%d\n", query(list, i));
        } else if (option == CMD_UPDATE_RANGES) {
            update_ranges(list);
        } else if (option == CMD_PRINT) {
            print(list);
        } else {
            printf("Invalid command\n");
        }

        //printf("Enter command: ");
    }
    
    printf("\n");
    return 0;
}

Popular posts from this blog

Tips for Competitive Programming

-
Image
Competitive programming is by no means easy, I struggled with it for a long time. In this post I want to provide some helpful tips, which will hopefully be helpful to you at any stage in your competitive programming journey. How do I read problems? Read all the problems It is not always the case that the first problem is the easiest, because it cannot be assumed that problems are in difficulty order. Even if it was in "difficulty order", what the tutors think is difficult may be different from what you think is difficult. Read all the subtasks (this doesn't apply for contests such as ICPC) Subtasks help guide you towards observations and partial solution by presenting helpful subproblems. Note that this isn’t
Read more

Implementation tips for competitive programming

-
Implementation tips for competitive programming It’s uncommon for code you write to work properly the first time you run it. And if you’re not careful, you can spend hours debugging and still be left with code that doesn’t work. This is especially problematic in ICPC, when you have only one computer between three people. Below are a few tips on how to improve the implementation and debugging process.  Before you start implementing Proving your solution Once you have a solution, the first step is to convince yourself it is correct. If you skip this step, you could invest a lot of time into coding only to later realise that your entire idea is incorrect. You don’t need a formal mathematical proof, just enough that you are sure it works. When doing this, try to think about the worst cases which could break your algorithm, and then reason why they do or do not.  Planning your code Once you are sure you have a correct solution, the next step is to
Read more

The Art of Making Programming Problems

-
Image
Hello! Today we’ll explore the wonderful world of creating problems for programming contests. This article could be used as a sort of guide if you’re interested in writing problems yourself, but it’s intended for anyone interested in the process or philosophy behind making problems.   The scope of the article is quite broad, and in its four parts, we will discuss (1) why to make programming problems, (2) how to invent problems, (3) how to plan a contest, and (4) how to prepare problems. Do feel free to skip around if any of these topics tickle your fancy, or if you’re up for it, I invite you to read the article through from top to bottom. A lot of the thoughts presented here are based on my own modest experience with problem setting, mainly for university contests, informatics olympiads and miscellaneous educational purposes. Keep in mind that nothing I say is meant to prescribe a correct way to do things, just to describe what I’ve personally found effective for the work I’ve done. So
Read more

Interactive Tasks

-
Interactive tasks are tasks where your code interacts with another program, often called a grader , rather than simply reading input and printing output. Due to this novel format, people are often scared off and avoid attempting these problems. My goal in this blog is to remove your fear towards interactive tasks. Example Let's start with a basic example, Guess the Number , which you can view in more detail here . There is some hidden number and you have to interactively guess it. The hidden number is always an integer from 1 to 1000000.  You can make queries to the grader. Each query is an integer from 1 to 1000000. There are two different responses the grader can provide: "<" (without quotes), if the hidden number is less than the integer in your query, ">=" (without quotes), if the hidden number is greater than or equal to the integer in your query. When your program wants to guess the hidden number, print "! x" (without quotes), where x is th
Read more

Introduction to Dynamic Programming

-
Image
This is a quick 5 minute easy-to-read programme, for even the least experienced programmers. So you wanna see c some new programming, or some new epic pro-gamer move s to up your competitive programming skills. Well, look no further with this CPMsoc blog on dynamic programming! Well, the obvious question is what is dynamic programming? Dynamic programming is programming that is dynamic. A quick google search would reveal (or at least according to Programiz), " technique in computer programming that helps to efficiently solve a class of problems that have overlapping subproblems and optimal substructure property ." What does this actually mean though? The paramount idea regarding dynamic programming circulates around the idea of sub-programs; essentially taking a large problem and breaking it down into smaller problems. Then, the values of the smaller-problems are saved to be used later to solve the initial, larger problem. Accordingly, the key benefit of dynamic programmin
Read more

Introduction to Competitive Programming

-
Introduction to Competitive Programming  Have you heard your friends talk about LeetCode or Codeforces contests? Maybe you’re wondering what competitive programming is all about. Here’s what you need to know. What is Competitive Programming? Competitive Programming (CP, or sometimes known as Informatics) is an activity where we try to solve clearly defined computational problems using code. The 'competitive' part of CP comes from the numerous contests where people aim to correctly solve as many problems as possible in a fixed timeframe, typically around two to five hours. Solutions must also follow time and memory constraints which means your code needs to be both correct and efficient. These problems are thought to train and test you in three related areas: Problem solving . Algorithms and data structures , which we apply to solve problems efficiently. Implementation , the process of writing and testing code. Many people participate in competitive programming for the challeng
Read more

Fracturing Search

-
Image
Have you ever had that insatiable urge to find the kth smallest minimum spanning subtree which of a weighted graph? (I know I have) Well look no further! This post will an exploration of fracturing search and its applications. (No prerequisite knowledge it required to understand the concepts, although it will be helpful graph theory terminology and an algorithm that solves the standard minimum spanning tree problem.) An example - finding the kth smallest value in a heap Fracturing search is a method that partitions your search space, and explores it in a way to get the "kth best" item. Let me illustrate with an example: Lets consider a heap, which is a binary tree where the value of a parent is always strictly smaller than the value of any child (this property is known as the heap invariant). For example, 1 < 2 and 1 < 7, because (1) is the parent of (2) and (7). We want to find the kth smallest value. Now is a good time to pause and think if you want to try it yourself
Read more

Union-find Disjoint set

-
Image
Union-find Disjoint set (UFDS) is an abstract data structure that simulates a collection of elements belongs to a collection of sets, where we need to support the following two operations Determine if two element belongs to same set, Combine two disjoint set. Such a data structure can be helpful in situation such as finding connected component of a diagram, for example Kruskal's algorithm. Linked list Implementation We would want to support the above operation with decent efficiency. The main paradigm  for supporting such data structure is to choose one unique element to represent the  set. Then, a naïve approach would be using a linked list, where each node contains a  parent pointer points back to the head, which is used to represent the set . It gives  constant time to determine if two element belongs to same set by looking  up the parent pointer's address of this two element. To combine two disjoint sets, denote set S1 and set S2 . The operation would be choice  one set f
Read more