C programming leveldbSort the level 0 table, careful not to exchange the order of pairs with equal valued keys.When multiple pairs exist with the same key, discard all but the most recent pair. Do retain tombstones.Do a merge (see merge-sort) of the resulting table with the level 0 table. In cases of equal keys in both tables, discard the pair in the level 2 table (it is older). Discard tombstones.int selection_sort(FILE * lev_file, struct KV_PAIR * kvp_a) {int kvp_i = 0 ;struct KV_PAIR kv_pair ;int idx, // ... return kvp_i ;} int merge_tables(FILE * out_file, FILE * l2_file, struct KV_PAIR * kvp_a, int n) { int count = 0 ; // ... return count ;}

Solution:-- 1)The given question has required for the solution to be provided in the form of C…

Answered: C programming leveldb Sort the level 0…

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

Related questions

Question

C programming leveldb

Sort the level 0 table, careful not to exchange the order of pairs with equal valued keys.
When multiple pairs exist with the same key, discard all but the most recent pair. Do retain tombstones.
Do a merge (see merge-sort) of the resulting table with the level 0 table. In cases of equal keys in both tables, discard the pair in the level 2 table (it is older). Discard tombstones.

int selection_sort(FILE * lev_file, struct KV_PAIR * kvp_a) {

int kvp_i = 0 ;

struct KV_PAIR kv_pair ;

int idx,

// ...

return kvp_i ;

}

int merge_tables(FILE * out_file, FILE * l2_file, struct KV_PAIR * kvp_a, int n) {

int count = 0 ;

// ...

return count ;

}