prabhakar9885

{
    "public_identifier": "prabhakar-bikkaneti",
    "profile_pic_url": "https://media.licdn.com/dms/image/v2/C4D03AQFt7yZGh0gmlQ/profile-displayphoto-shrink_800_800/profile-displayphoto-shrink_800_800/0/1517497828336?e=1732752000&v=beta&t=LsV14xXesBA2Cy0jwVpFgLmAjk0UFgTYGKRv_DuhHaI",
    "background_cover_image_url": null,
    "first_name": "Prabhakar",
    "last_name": "Bikkaneti",
    "full_name": "Prabhakar Bikkaneti",
    "follower_count": 713,
    "occupation": "Senior Software Engineer at NVIDIA",
    "headline": "Senior Software Engineer at NVIDIA",

prabhakar9885

#!/usr/bin/env python
# -----------------------------------------------------------------------------
# Voronoi diagram from a list of points
# Copyright (C) 2011  Nicolas P. Rougier
#
# Distributed under the terms of the BSD License.
# -----------------------------------------------------------------------------
import numpy as np
import matplotlib
import matplotlib.pyplot as plt

prabhakar9885

/* Skip Lists: A Probabilistic Alternative to Balanced Trees */

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

#define SKIPLIST_MAX_LEVEL 6

typedef struct snode {
    int key;