Create org table of sorting algorithms and their efficiency
This is just a small org table that I created to help me Fun fact: In Emacs, you can insert literal TAB character by pressing `C-q TAB`. For creating tables, using TAB characters feels perfectly acceptable. Perhaps the TAB name comes from TABle.
This commit is contained in:
		
							parent
							
								
									de039c7133
								
							
						
					
					
						commit
						2a0540d76d
					
				
					 1 changed files with 6 additions and 0 deletions
				
			
		
							
								
								
									
										6
									
								
								deepmind/efficiency.org
									
										
									
									
									
										Normal file
									
								
							
							
						
						
									
										6
									
								
								deepmind/efficiency.org
									
										
									
									
									
										Normal file
									
								
							| 
						 | 
					@ -0,0 +1,6 @@
 | 
				
			||||||
 | 
					* Sorting
 | 
				
			||||||
 | 
					** Merge:	O(n*log(n))
 | 
				
			||||||
 | 
					** Heap:	O(n*log(n))
 | 
				
			||||||
 | 
					** Insertion:	O(n^2)
 | 
				
			||||||
 | 
					** Quick:	O(n^2)
 | 
				
			||||||
 | 
					** Bubble:	O(n^2)
 | 
				
			||||||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue