Update sysbench_perf_degradation.md

sysbench_perf_degradation.md

@@ -86,14 +86,13 @@ pointer dereferences, compared to vector's indexed access which performs only on
 The storage of a deque is automatically expanded and contracted as needed. Expansion of a deque is cheaper than the expansion 
 of a std::vector because it does not involve copying of the existing elements to a new memory location. On the other hand, 
 deques typically have large minimal memory cost; a deque holding just one element has to allocate its full internal array 
-(e.g. 8 times the object size on 64-bit libstdc++; 16 times the object size or 4096 bytes, whichever is larger, on 64-bit libc++).
+(e.g. 8 times the object size on 64-bit libstdc++; 16 times the object size or 4096 bytes, whichever is larger, on 64-bit 
+libc++).
 
 The complexity (efficiency) of common operations on deques is as follows:
 Random access - constant O(1).
 Insertion or removal of elements at the end or beginning - constant O(1).
 Insertion or removal of elements - linear O(n).
-
-
 ```
 
 As shown in the above description, in extreme cases, retaining a single element requires allocating the entire array, resulting in very low memory efficiency. For example, in bulk inserts, where a large number of records need to be inserted, the official implementation stores each record in a separate deque. Even if the record content is minimal, a deque must still be allocated. The MySQL deque implementation allocates 1KB of memory for each deque to support fast lookups.