available memorywhile an array is limited to fixed size howevera sorted list is somewhat more difficult to implement than sorted array later we'll look at one application for sorted listssorting data sorted list can also be used to implement priority queuealthough heap (see "heaps"is more common implementation the linklist workshop applet introduced at the beginning of this demonstrates sorted as well as unsorted lists to see how sorted lists workuse the new button to create new list with about linksand when promptedclick on the sorted button the result is list with data in sorted orderas shown in figure figure the linklist workshop applet with sorted list use the ins button to insert new item type in value that will fall somewhere in the middle of the list watch as the algorithm traverses the linkslooking for the appropriate insertion place when it finds the correct locationit inserts the new linkas shown in figure with the next press of insthe list will be redrawn to regularize its appearance you can also find specified link using the find button and delete specified link using the del button java code to insert an item in sorted list to insert an item in sorted listthe algorithm must first search through the list until it finds the appropriate place to put the itemthis is just before the first item that' largeras shown in figure