One does not have to pay close attention to choosing data structures appropriate for the operations performed by the algorithm

Explanation

That is false.

For example, choosing to work with a linked list rather than an array may cause performance degradation in some algorithms.  Arrays allow random access and consume less memory per element since there is no space for pointers while lacking efficiency for insertion/deletion operations and memory allocation. On the other hand, linked lists are flexibly easier and faster inserting and deleting elements.