File:Representation of stack for merge memory in Timsort.svg

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search

Original file (SVG file, nominally 512 × 266 pixels, file size: 6 KB)

Captions

Captions

Add a one-line explanation of what this file represents

Summary

[edit]
Description
English: In Timsort, the minruns are inserted in a stack. If X < Y + Z then X and Y are merged and then inserted into a stack. In this way, merging is continued until all arrays satisfy a) X > Y + Z and b) Y > Z
Date
Source Own work
Author Charanya.vish

Licensing

[edit]
I, the copyright holder of this work, hereby publish it under the following license:
w:en:Creative Commons
attribution share alike
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current03:20, 30 November 2011Thumbnail for version as of 03:20, 30 November 2011512 × 266 (6 KB)Charanya.vish (talk | contribs)

You cannot overwrite this file.

There are no pages that use this file.

File usage on other wikis

The following other wikis use this file:

Retrieved from "https://commons.wikimedia.org/w/index.php?title=File:Representation_of_stack_for_merge_memory_in_Timsort.svg&oldid=945326125"