Henke Larsson AB

• arrays are static or dynamic and they always have memory adjectent layout which allow us to use a pointer + offset strategy to acces them
• linked list do not need linear memory show impl in zig and c

• hashmap impl show impl in zig and c

  #include <stdio.h>
  int main() {
      printf("Hello, World!\n");
      return 0;
  }
  

  const std = @import("std");
  pub fn main() void {
      std.debug.print("Hello, World!\n", .{});
  }
  

This is things I like for private use, I do not make any claims of what are best in an enterprise setting. When making choices for an enterprice there are so many additional things that come in then selecteing just the right tool for the job.