```
#!/usr/local/bin/python3
import sys
def print_factorial( user_val ):
if( user_val < 1 ):
return( 1 )
else:
return( print_factorial( user_val - 1 ) * user_val )
if( __name__ == "__main__" ):
if( len( sys.argv ) == 2 ):
print( print_factorial( int ( sys.argv[ 1 ] ) ) )
else:
sys.stderr.write( "usage: %s <integer>\n" % sys.argv[ 0 ] )
exit( 0 )
```
The Andromeda Galaxy would be my answer.
Answer:
speed and storage
Explanation:
The pros and cons of both are mainly in regards to speed and storage. Due to linked lists elements being connected to one another it requires that each previous element be accessed in order to arrive at a specific element. This makes it much slower than an array-based implementation where any element can be quickly accessed easily due to it having a specific location. This brings us to the other aspect which is memory. Since Arrays are saved as a single block, where each element has a specific location this takes much more space in the RAM as opposed to a linked implementation which is stored randomly and as indexes of the array itself.
Array Implementation:
- Pros: Much Faster and Easier to target a specific element
- Cons: Much More Space needed
Linked Implementation
- Pros: Less overall space needed
- Cons: Much slower speed.
