mirror of
				https://github.com/krahets/hello-algo.git
				synced 2025-10-31 18:37:48 +08:00 
			
		
		
		
	 803c0e09c7
			
		
	
	803c0e09c7
	
	
	
		
			
			* update zig array list chapter * update not need change codes. * fix some pr issues and update time space chapter
		
			
				
	
	
		
			26 lines
		
	
	
		
			1005 B
		
	
	
	
		
			Zig
		
	
	
	
	
	
			
		
		
	
	
			26 lines
		
	
	
		
			1005 B
		
	
	
	
		
			Zig
		
	
	
	
	
	
| const std = @import("std");
 | |
| 
 | |
| const iteration = @import("chapter_computational_complexity/iteration.zig");
 | |
| const recursion = @import("chapter_computational_complexity/recursion.zig");
 | |
| const time_complexity = @import("chapter_computational_complexity/time_complexity.zig");
 | |
| const space_complexity = @import("chapter_computational_complexity/space_complexity.zig");
 | |
| const worst_best_time_complexity = @import("chapter_computational_complexity/worst_best_time_complexity.zig");
 | |
| 
 | |
| const array = @import("chapter_array_and_linkedlist/array.zig");
 | |
| const linked_list = @import("chapter_array_and_linkedlist/linked_list.zig");
 | |
| const list = @import("chapter_array_and_linkedlist/list.zig");
 | |
| const my_list = @import("chapter_array_and_linkedlist/my_list.zig");
 | |
| 
 | |
| pub fn main() !void {
 | |
|     try iteration.run();
 | |
|     recursion.run();
 | |
|     time_complexity.run();
 | |
|     try space_complexity.run();
 | |
|     worst_best_time_complexity.run();
 | |
| 
 | |
|     try array.run();
 | |
|     linked_list.run();
 | |
|     try list.run();
 | |
|     try my_list.run();
 | |
| }
 |