DATA STRUCTURE AND ALGORITHM USING PYTHON

Transcription

1 DATA STRUCTURE AND ALGORITHM USING PYTHON Sorting, Searching Algorithm and Regular Expression Peter Lo

2 Sorting Algorithms Put Elements of List in Certain Order 2

3 Bubble Sort The bubble sort makes multiple passes through a list. It compares adjacent items and exchanges those that are out of order. Each pass through the list places the next largest value in its proper place. In essence, each item bubbles up to the location where it belongs. If there are n items in the list, then there are n 1 pairs of items that need to be compared on the first pass. It is important to note that once the largest value in the list is part of a pair, it will continually be moved along until the pass is complete. 3

4 Bubble Sort Workflow fds 4

5 Example 5

6 Selection Sort The selection sort improves on the bubble sort by making only one exchange for every pass through the list. In order to do this, a selection sort looks for the smallest/largest value as it makes a pass and, after completing the pass, places it in the proper location. As with a bubble sort, after the first pass, the largest item is in the correct place. After the second pass, the next largest is in place. This process continues and requires n 1 passes to sort n items, since the final item must be in place after the (n 1) pass. 6

7 Selection Sort Workflow 7

8 Example (Find the Smallest) 8

9 Example (Find the Largest) 9

10 Insertion Sort The insertion sort always maintains a sorted sublist in the lower positions of the list. Each new item is then inserted back into the previous sublist such that the sorted sublist is one item larger. We begin by assuming that a list with one item (position 0) is already sorted. On each pass, one for each item 1 through n 1, the current item is checked against those in the already sorted sublist. As we look back into the already sorted sublist, we shift those items that are greater to the right. When we reach a smaller item or the end of the sublist, the current item can be inserted 10

11 Insertion Sort Workflow 11

12 Example 12

13 Merge Sort Merge Sort is a recursive algorithm that continually splits a list in half. If the list is empty or has one item, it is sorted by definition. If the list has more than one item, we split the list and recursively invoke a merge sort on both halves. Once the two halves are sorted, the fundamental operation, called a merge, is performed. Merging is the process of taking two smaller sorted lists and combining them together into a single, sorted, new list. 13

14 Merge Sort Workflow 1. Divide the list into two parts 2. Divide the list into two parts again 3. Break each element into single part 4. Sort the element from smallest to largest 5. Merge the divided sorted arrays together 6. The array has been sorted 14

15 Example 15

16 Quick Sort The Quick Sort algorithm consists of three steps: Divide: Partition the list To partition the list, we first choose a Pivot from the list for which we hope about half the elements will come before and half after. Then we partition the elements so that all those with value less than the pivot come in one sub list and all those with greater values come in another Recursion: Recursively sort the sub lists separately Conquer: Put the sorted sub lists together 16

17 Quick Sort Workflow 17

18 Example 18

19 Comparison of Sorting Algorithm Worst Case Average Case Selection Sort n 2 n 2 Bubble Sort n 2 n 2 Insertion Sort n 2 n 2 Merge Sort n x log n n x log n Quick Sort n 2 n x log n 19

20 Python sort() Function Python lists have a built-in list.sort() method that modifies the list in-place. There is also a sorted() built-in function that builds a new sorted list from an iterable. 20

21 Which algorithm does Python sorted() use? Timsort has been Python's standard sorting algorithm since version 2.3. Timsort is a hybrid sorting algorithm, derived from Merge Sort and Insertion Sort, designed to perform well on many kinds of real-world data. It was invented by Tim Peters in 2002 for use in the Python programming language. The algorithm finds subsets of the data that are already ordered, and uses the subsets to sort the data more efficiently. This is done by merging an identified subset, called a run, with existing runs until certain criteria are fulfilled. 21

22 Searching Algorithms Sequential Search, Binary Search 22

23 Sequential Search Starting at the first item in the list, we simply move from item to item, following the underlying sequential ordering until we either find what we are looking for or run out of items. If we run out of items, we have discovered that the item we were searching for was not present 23

24 Example 24

25 Binary Search Instead of searching the list in sequence, a binary search will start by examining the middle item. If that item is the one we are searching for, we are done. If it is not the correct item, we can use the ordered nature of the list to eliminate half of the remaining items. If the item we are searching for is greater than the middle item, we know that the entire lower half of the list as well as the middle item can be eliminated from further consideration. The item, if it is in the list, must be in the upper half. We can then repeat the process with the upper half. Start at the middle item and compare it against what we are looking for. Again, we either find it or split the list in half, therefore eliminating another large part of our possible search space. 25

26 Binary Search Workflow 26

27 Example 27

28 Comparison 28

29 Regular Expression A Simplified Guide 29

30 Regular Expression Module A regular expression in a programming language is a special text string used for describing a search pattern. It is extremely useful for extracting information from text such as code, files, log, spreadsheets or even documents. It is widely used in natural language processing, web applications that require validating string and pretty much most data science projects that involve text mining. In python, it is implemented in the standard module re. More information can be found in 30

31 What is a regex pattern? A regex pattern is a special language used to represent generic text, numbers or symbols so it can be used to extract texts that conform to that pattern. Consider an example expression \s+. Here the \s matches any whitespace character. By adding a '+' notation at the end will make the pattern match at least 1 or more spaces. So this pattern will match even tab characters as well. 31

32 Split String Separated by regex If you intend to use a particular pattern multiple times, then you are better off compiling a regular expression rather than using re.split over and over again. This file contain three column, but the separator are different. The '\s' matches any whitespace character. By adding a '+' notation at the end will make the pattern match at least 1 or more spaces. This pattern will match even tab '\t' characters as well 32

33 Greedy vs Non-greedy Matching Greedy matching gets the longest results possible Nongreedy matching gets the shortest possible Consider an String = 123 ABC 456 xyz For greedy expression: \d+ Result: ['123', '456 ] Maximizes the length of \d For non-greedy expression: \d+? Result: ['1', '2', '3', '4', '5', '6'] Minimizes the length of \d 33

34 Wildcards and Anchors. (a dot) matches any character except \n ".oo.y" matches "Doocy", "goofy", "LooPy",... use \. to literally match a dot. character 34

35 Wildcards and Anchors ^ matches the beginning of a line; $ the end "^fi$" matches lines that consist entirely of fi \< demands that pattern is the beginning of a word; \> demands that pattern is the end of a word "\<for\>" matches lines that contain the word "for" 35

36 Boolean means OR "abc def g" matches lines with "abc", "def", or "g" precedence of ^(Subject Date) vs. ^Subject Date: There's no AND symbol. 36

37 Grouping () are for grouping "(Homer Marge)" matches lines containing "Homer" or "Marge" 37

38 Finding Matched Pattern There are three method for searching matched pattern: findall() returns the matched portions of the text as a list search() returns a particular match object that contains the starting and ending positions of the first occurrence of the pattern. match() also returns a match object, but the difference is, it requires the pattern to be present at the beginning of the text itself. 38

39 Finding Pattern using findall The findall() method extracts all occurrences of the 1 or more digits from the text and returns them in a list. the special character '\d' is a regular expression which matches any digit. Adding a '+' symbol to it mandates the presence of at least 1 digit to be present in order to be found. 39

40 Finding Pattern using search The search() method return the found value together with its position. 40

41 Finding Pattern using match If the pattern is not present at the beginning of the text itself, the match() method unable to find the result. 41

42 Substitute Text with Another To replace texts, use the sub() method. 42

43 Regular Expression Quick Guide Symbol Meaning ^ Matches the beginning of a line $ Matches the end of the line. Matches any character except line terminators like \n. * Repeats a character zero or more times *? Repeats a character zero or more times (non-greedy) + Repeats a character one or more times +? Repeats a character one or more times (non-greedy) ( Indicates where string extraction is to start ) Indicates where string extraction is to end 43

44 Regular Expression Quick Guide Symbol \s Matches whitespace Meaning \S Matches any non-whitespace character \d Matches a digit \D Matches a non-digit \w Matches alphanumeric characters which means a-z, A-Z, 0-9 and underscore, _. \W Matches a non-alphanumeric characters \n Matches a new line [abcde] [^xyz] [a-z0-9] Matches a single character in the listed set Matches a single character not in the listed set The set of characters can include a range 44