OccupyMars2025 Introduction-to-Algorithms-4th-Edition issues

OccupyMars2025 / Introduction-to-Algorithms-4th-Edition

Time is Money, Efficiency is Life

MIT License

1 stars 0 forks source link

issues

Newest

Newest Most commented Recently updated Oldest Least commented Least recently updated

[solved] page 392, Exercise 14.3-1

#17 OccupyMars2025 opened 3 weeks ago
1
[TODO] study Catalan numbers, its relationship with "number of ways of fully parenthesizing the matrix chain multiplication", "number of full binary trees with n leaves"

#16 OccupyMars2025 opened 3 weeks ago
2
[TODO] How to generate a random integer number from within a range

#15 OccupyMars2025 opened 1 month ago
0
[solved] my solution to the Exercise 14.2-5 is different from the authors' answer

#14 OccupyMars2025 opened 1 month ago
1
[TODO] pieces are cut in order of monotonically increasing size

#13 OccupyMars2025 opened 2 months ago
0
[solved][bug][ch13, red-black tree] After inserting 10 nodes, I get only 4 nodes

#12 OccupyMars2025 closed 5 months ago
1
[solved][debug][ Exercise 12.3-6] in C++, tree_delete method have bugs

#11 OccupyMars2025 closed 5 months ago
2
[solved][debug][ Exercise 12.3-6] in python, tree_delete method have bugs

#10 OccupyMars2025 closed 5 months ago
2
[TODO][improve] practice_programming/0001. Battle Over Cities: both c++ and python implementation "Time Limit Exceeded"

#9 OccupyMars2025 opened 5 months ago
0
[solved][bug] when I change `vector<tuple<int, int, int>> repair_edges;` to `priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, CompareCost> repair_edges;`, there occurs an error for some unknown test case

#8 OccupyMars2025 closed 5 months ago
0
[solved] difference between `path splitting` and `path halving` on https://en.wikipedia.org/wiki/Disjoint-set_data_structure

#7 OccupyMars2025 closed 5 months ago
0
[solved][amazing solution][ch12, binary search trees] k successive calls to TREE-SUCCESSOR take O(k+h) time

#6 OccupyMars2025 closed 5 months ago
0
[new theorem][ch12: binary search tree] running time of traversal of binary tree

#5 OccupyMars2025 opened 5 months ago
0
[TODO] new implementation for the PARTITION procedure in the QUICKSORT

#4 OccupyMars2025 opened 6 months ago
0
[solved] amazingly conter-intuitive: Suppose that instead of swapping element A[i] with a random element from the subarray A[i:n], we swapped it with a random element from anywhere in the array

#3 OccupyMars2025 closed 5 months ago
0
[TODO] book, page 95, problem 3-5, (f) and (g)

#2 OccupyMars2025 opened 6 months ago
0
[TODO] In binary search algorithm, where to insert the value while maintaining the sorted order of the list if it doesn't exist ? Make the reasoning more concise.

#1 OccupyMars2025 opened 6 months ago
0